./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/960521-1-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/960521-1-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c10f64ae1701d633846cd3dbd537781b9e2aef0b0b5befdebbc22e76d228933b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:54:25,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:54:25,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:54:25,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:54:25,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:54:25,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:54:25,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:54:25,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:54:25,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:54:25,206 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:54:25,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:54:25,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:54:25,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:54:25,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:54:25,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:54:25,207 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:54:25,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:54:25,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:54:25,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:54:25,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:54:25,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:54:25,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:54:25,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:54:25,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:54:25,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:54:25,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:54:25,208 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c10f64ae1701d633846cd3dbd537781b9e2aef0b0b5befdebbc22e76d228933b [2025-03-17 11:54:25,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:54:25,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:54:25,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:54:25,415 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:54:25,415 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:54:25,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/960521-1-3.i [2025-03-17 11:54:26,571 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f969b7d72/857e03b4e8314c85a3446e2445dc0a30/FLAG540f6b081 [2025-03-17 11:54:26,830 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:54:26,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/960521-1-3.i [2025-03-17 11:54:26,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f969b7d72/857e03b4e8314c85a3446e2445dc0a30/FLAG540f6b081 [2025-03-17 11:54:27,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f969b7d72/857e03b4e8314c85a3446e2445dc0a30 [2025-03-17 11:54:27,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:54:27,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:54:27,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:54:27,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:54:27,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:54:27,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49286980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27, skipping insertion in model container [2025-03-17 11:54:27,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:54:27,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:54:27,371 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:54:27,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:54:27,423 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:54:27,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27 WrapperNode [2025-03-17 11:54:27,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:54:27,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:54:27,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:54:27,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:54:27,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,458 INFO L138 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-03-17 11:54:27,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:54:27,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:54:27,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:54:27,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:54:27,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,476 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 1, 3]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-03-17 11:54:27,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:54:27,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:54:27,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:54:27,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:54:27,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (1/1) ... [2025-03-17 11:54:27,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:54:27,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:54:27,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:54:27,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:54:27,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:54:27,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:54:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 11:54:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:54:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:54:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 11:54:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:54:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:54:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:54:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:54:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:54:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 11:54:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:54:27,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:54:27,609 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:54:27,610 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:54:27,755 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-17 11:54:27,755 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:54:27,762 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:54:27,762 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:54:27,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:54:27 BoogieIcfgContainer [2025-03-17 11:54:27,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:54:27,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:54:27,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:54:27,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:54:27,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:54:27" (1/3) ... [2025-03-17 11:54:27,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a27b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:54:27, skipping insertion in model container [2025-03-17 11:54:27,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:27" (2/3) ... [2025-03-17 11:54:27,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a27b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:54:27, skipping insertion in model container [2025-03-17 11:54:27,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:54:27" (3/3) ... [2025-03-17 11:54:27,771 INFO L128 eAbstractionObserver]: Analyzing ICFG 960521-1-3.i [2025-03-17 11:54:27,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:54:27,784 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 960521-1-3.i that has 1 procedures, 48 locations, 1 initial locations, 2 loop locations, and 21 error locations. [2025-03-17 11:54:27,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:54:27,817 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@12bea5d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:54:27,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-17 11:54:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 11:54:27,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:27,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 11:54:27,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:27,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:27,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2495, now seen corresponding path program 1 times [2025-03-17 11:54:27,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:27,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103905643] [2025-03-17 11:54:27,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:27,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 11:54:27,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 11:54:27,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:27,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:27,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:27,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103905643] [2025-03-17 11:54:27,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103905643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:54:27,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:54:27,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:54:27,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965046856] [2025-03-17 11:54:27,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:54:27,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:54:27,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:28,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:54:28,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:54:28,003 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:28,051 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2025-03-17 11:54:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:54:28,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-03-17 11:54:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:28,059 INFO L225 Difference]: With dead ends: 47 [2025-03-17 11:54:28,059 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 11:54:28,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:54:28,062 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:28,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:54:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 11:54:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-17 11:54:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.88) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2025-03-17 11:54:28,086 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 2 [2025-03-17 11:54:28,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:28,086 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2025-03-17 11:54:28,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2025-03-17 11:54:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 11:54:28,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:28,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 11:54:28,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:54:28,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:28,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2496, now seen corresponding path program 1 times [2025-03-17 11:54:28,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:28,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259168034] [2025-03-17 11:54:28,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:28,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:28,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 11:54:28,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 11:54:28,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:28,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:28,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:28,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259168034] [2025-03-17 11:54:28,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259168034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:54:28,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:54:28,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:54:28,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594488899] [2025-03-17 11:54:28,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:54:28,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:54:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:28,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:54:28,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:54:28,205 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:28,223 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2025-03-17 11:54:28,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:54:28,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-03-17 11:54:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:28,223 INFO L225 Difference]: With dead ends: 44 [2025-03-17 11:54:28,223 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 11:54:28,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:54:28,224 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:28,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:54:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 11:54:28,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 11:54:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.84) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2025-03-17 11:54:28,230 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 2 [2025-03-17 11:54:28,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:28,230 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2025-03-17 11:54:28,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2025-03-17 11:54:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:54:28,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:28,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:54:28,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:54:28,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:28,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash 74342412, now seen corresponding path program 1 times [2025-03-17 11:54:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:28,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6364699] [2025-03-17 11:54:28,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:28,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:54:28,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:54:28,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:28,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:28,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:28,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6364699] [2025-03-17 11:54:28,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6364699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:54:28,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:54:28,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:54:28,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470950665] [2025-03-17 11:54:28,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:54:28,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:54:28,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:28,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:54:28,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:54:28,313 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:28,342 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-03-17 11:54:28,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:54:28,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:54:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:28,343 INFO L225 Difference]: With dead ends: 41 [2025-03-17 11:54:28,343 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 11:54:28,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:54:28,344 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:28,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 48 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:54:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 11:54:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 11:54:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.72) internal successors, (43), 40 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-03-17 11:54:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2025-03-17 11:54:28,346 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 5 [2025-03-17 11:54:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:28,346 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2025-03-17 11:54:28,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2025-03-17 11:54:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:54:28,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:28,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:54:28,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:54:28,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:28,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash 74342413, now seen corresponding path program 1 times [2025-03-17 11:54:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:28,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-03-17 11:54:28,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:28,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:54:28,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:54:28,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:28,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:28,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:28,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-03-17 11:54:28,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561370982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:54:28,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:54:28,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:54:28,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270782716] [2025-03-17 11:54:28,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:54:28,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:54:28,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:28,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:54:28,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:54:28,513 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:28,593 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-03-17 11:54:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:54:28,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:54:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:28,595 INFO L225 Difference]: With dead ends: 46 [2025-03-17 11:54:28,595 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 11:54:28,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:54:28,596 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 50 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:28,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 58 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:54:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 11:54:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2025-03-17 11:54:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 41 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-03-17 11:54:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2025-03-17 11:54:28,600 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 5 [2025-03-17 11:54:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:28,600 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2025-03-17 11:54:28,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2025-03-17 11:54:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:54:28,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:28,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:54:28,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:54:28,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:28,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1990357418, now seen corresponding path program 1 times [2025-03-17 11:54:28,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:28,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506386721] [2025-03-17 11:54:28,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:28,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:28,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:54:28,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:54:28,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:28,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:28,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-03-17 11:54:28,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:28,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506386721] [2025-03-17 11:54:28,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506386721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:54:28,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:54:28,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:54:28,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3285715] [2025-03-17 11:54:28,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:54:28,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:54:28,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:28,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:54:28,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:54:28,640 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:28,664 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2025-03-17 11:54:28,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:54:28,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:54:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:28,665 INFO L225 Difference]: With dead ends: 46 [2025-03-17 11:54:28,665 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 11:54:28,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:54:28,666 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 51 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:28,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 62 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:54:28,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 11:54:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2025-03-17 11:54:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2025-03-17 11:54:28,668 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 6 [2025-03-17 11:54:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:28,668 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2025-03-17 11:54:28,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2025-03-17 11:54:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:54:28,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:28,668 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 11:54:28,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:54:28,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:28,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:28,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1468319781, now seen corresponding path program 1 times [2025-03-17 11:54:28,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:28,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103491172] [2025-03-17 11:54:28,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:28,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:28,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:54:28,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:54:28,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:28,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:28,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:28,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103491172] [2025-03-17 11:54:28,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103491172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:54:28,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733759736] [2025-03-17 11:54:28,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:28,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:54:28,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:54:28,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:54:28,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:54:28,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:54:28,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:54:28,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:28,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:29,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 11:54:29,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:54:29,055 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:54:29,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2025-03-17 11:54:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:29,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:54:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:29,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733759736] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:54:29,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:54:29,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-03-17 11:54:29,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897805888] [2025-03-17 11:54:29,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:54:29,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:54:29,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:29,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:54:29,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:54:29,267 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:29,549 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2025-03-17 11:54:29,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:54:29,550 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 11:54:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:29,550 INFO L225 Difference]: With dead ends: 59 [2025-03-17 11:54:29,550 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 11:54:29,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:54:29,551 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 128 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:29,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 130 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:54:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 11:54:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-03-17 11:54:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2025-03-17 11:54:29,554 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2025-03-17 11:54:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:29,554 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2025-03-17 11:54:29,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2025-03-17 11:54:29,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:54:29,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:29,555 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2025-03-17 11:54:29,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:54:29,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 11:54:29,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:29,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash 497678989, now seen corresponding path program 2 times [2025-03-17 11:54:29,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:29,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381265730] [2025-03-17 11:54:29,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:54:29,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:29,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 11:54:29,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:54:29,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:54:29,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:30,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:30,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381265730] [2025-03-17 11:54:30,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381265730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:54:30,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978577278] [2025-03-17 11:54:30,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:54:30,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:54:30,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:54:30,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:54:30,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:54:30,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 11:54:30,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:54:30,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:54:30,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:30,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 11:54:30,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:54:30,216 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-03-17 11:54:30,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 19 [2025-03-17 11:54:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:30,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:54:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:30,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978577278] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:54:30,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:54:30,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2025-03-17 11:54:30,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472875441] [2025-03-17 11:54:30,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:54:30,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 11:54:30,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:30,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 11:54:30,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:54:30,884 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:31,367 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2025-03-17 11:54:31,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:54:31,369 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 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-03-17 11:54:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:31,370 INFO L225 Difference]: With dead ends: 75 [2025-03-17 11:54:31,370 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 11:54:31,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=710, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:54:31,371 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 234 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:31,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 107 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:54:31,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 11:54:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2025-03-17 11:54:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 66 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-03-17 11:54:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2025-03-17 11:54:31,378 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 17 [2025-03-17 11:54:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:31,378 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2025-03-17 11:54:31,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2025-03-17 11:54:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:54:31,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:31,379 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-17 11:54:31,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:54:31,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 11:54:31,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:31,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1979349354, now seen corresponding path program 1 times [2025-03-17 11:54:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:31,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53170435] [2025-03-17 11:54:31,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:31,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:31,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:54:31,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:54:31,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:31,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:54:31,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:31,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53170435] [2025-03-17 11:54:31,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53170435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:54:31,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:54:31,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:54:31,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654916518] [2025-03-17 11:54:31,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:54:31,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:54:31,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:31,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:54:31,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:54:31,637 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:31,669 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2025-03-17 11:54:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:54:31,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-17 11:54:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:31,670 INFO L225 Difference]: With dead ends: 65 [2025-03-17 11:54:31,670 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 11:54:31,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-03-17 11:54:31,671 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:31,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 54 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:54:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 11:54:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 11:54:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 64 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-03-17 11:54:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2025-03-17 11:54:31,674 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 24 [2025-03-17 11:54:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:31,674 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2025-03-17 11:54:31,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2025-03-17 11:54:31,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:54:31,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:31,675 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-17 11:54:31,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:54:31,675 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:31,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:31,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1979349353, now seen corresponding path program 1 times [2025-03-17 11:54:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035962910] [2025-03-17 11:54:31,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:31,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:31,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:54:31,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:54:31,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:31,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:31,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:31,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035962910] [2025-03-17 11:54:31,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035962910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:54:31,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6726930] [2025-03-17 11:54:31,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:31,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:54:31,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:54:31,769 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:54:31,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:54:31,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:54:31,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:54:31,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:31,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:31,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:54:31,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:54:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:31,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:54:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:32,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6726930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:54:32,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:54:32,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-17 11:54:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595307782] [2025-03-17 11:54:32,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:54:32,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 11:54:32,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:32,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 11:54:32,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:54:32,016 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 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-03-17 11:54:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:32,205 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2025-03-17 11:54:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:54:32,206 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 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) Word has length 24 [2025-03-17 11:54:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:32,206 INFO L225 Difference]: With dead ends: 113 [2025-03-17 11:54:32,207 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 11:54:32,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:54:32,208 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 296 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:32,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 164 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:54:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 11:54:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2025-03-17 11:54:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 94 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2025-03-17 11:54:32,215 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 24 [2025-03-17 11:54:32,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:32,215 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2025-03-17 11:54:32,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 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-03-17 11:54:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2025-03-17 11:54:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 11:54:32,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:32,216 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1] [2025-03-17 11:54:32,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:54:32,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:54:32,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:32,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash 45871511, now seen corresponding path program 2 times [2025-03-17 11:54:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:32,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552668632] [2025-03-17 11:54:32,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:54:32,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:32,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-17 11:54:32,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 48 statements. [2025-03-17 11:54:32,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:54:32,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-17 11:54:32,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:32,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552668632] [2025-03-17 11:54:32,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552668632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:54:32,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:54:32,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:54:32,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590786970] [2025-03-17 11:54:32,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:54:32,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:54:32,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:32,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:54:32,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:54:32,509 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:32,552 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2025-03-17 11:54:32,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:54:32,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-17 11:54:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:32,556 INFO L225 Difference]: With dead ends: 95 [2025-03-17 11:54:32,556 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 11:54:32,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-03-17 11:54:32,557 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 73 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:32,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 27 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:54:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 11:54:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 11:54:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2025-03-17 11:54:32,560 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 48 [2025-03-17 11:54:32,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:32,560 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2025-03-17 11:54:32,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2025-03-17 11:54:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:54:32,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:32,561 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:54:32,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:54:32,561 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:32,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:32,561 INFO L85 PathProgramCache]: Analyzing trace with hash 758557387, now seen corresponding path program 1 times [2025-03-17 11:54:32,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:32,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021133868] [2025-03-17 11:54:32,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:32,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:32,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:54:32,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:54:32,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:32,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:54:32,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021133868] [2025-03-17 11:54:32,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021133868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:54:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015718351] [2025-03-17 11:54:32,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:32,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:54:32,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:54:32,876 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:54:32,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:54:32,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:54:32,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:54:32,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:32,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:32,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 11:54:32,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:54:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:54:33,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:54:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:54:33,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015718351] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:54:33,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:54:33,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 48 [2025-03-17 11:54:33,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724134418] [2025-03-17 11:54:33,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:54:33,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-17 11:54:33,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:33,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-17 11:54:33,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=1325, Unknown=0, NotChecked=0, Total=2352 [2025-03-17 11:54:33,535 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 49 states, 49 states have (on average 2.857142857142857) internal successors, (140), 48 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:34,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:34,030 INFO L93 Difference]: Finished difference Result 209 states and 252 transitions. [2025-03-17 11:54:34,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 11:54:34,031 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.857142857142857) internal successors, (140), 48 states have internal predecessors, (140), 0 states have call successors, (0), 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 51 [2025-03-17 11:54:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:34,032 INFO L225 Difference]: With dead ends: 209 [2025-03-17 11:54:34,032 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 11:54:34,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1552, Invalid=2480, Unknown=0, NotChecked=0, Total=4032 [2025-03-17 11:54:34,033 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 490 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:34,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 191 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:54:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 11:54:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 167. [2025-03-17 11:54:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 156 states have (on average 1.1666666666666667) internal successors, (182), 166 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2025-03-17 11:54:34,037 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 51 [2025-03-17 11:54:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:34,037 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2025-03-17 11:54:34,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.857142857142857) internal successors, (140), 48 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2025-03-17 11:54:34,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 11:54:34,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:34,039 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:54:34,045 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-03-17 11:54:34,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:54:34,240 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:34,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:34,240 INFO L85 PathProgramCache]: Analyzing trace with hash 551883979, now seen corresponding path program 2 times [2025-03-17 11:54:34,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:34,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006121309] [2025-03-17 11:54:34,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:54:34,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:34,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-17 11:54:34,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 11:54:34,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:54:34,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-03-17 11:54:34,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:34,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006121309] [2025-03-17 11:54:34,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006121309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:54:34,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927490027] [2025-03-17 11:54:34,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:54:34,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:54:34,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:54:34,615 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-03-17 11:54:34,616 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-03-17 11:54:34,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-17 11:54:34,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 11:54:34,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:54:34,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:34,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 11:54:34,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:54:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:54:35,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:54:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:54:36,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927490027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:54:36,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:54:36,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 70 [2025-03-17 11:54:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851035669] [2025-03-17 11:54:36,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:54:36,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-17 11:54:36,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:36,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-17 11:54:36,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2096, Invalid=2874, Unknown=0, NotChecked=0, Total=4970 [2025-03-17 11:54:36,398 INFO L87 Difference]: Start difference. First operand 167 states and 182 transitions. Second operand has 71 states, 71 states have (on average 2.8732394366197185) internal successors, (204), 70 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:41,257 INFO L93 Difference]: Finished difference Result 400 states and 432 transitions. [2025-03-17 11:54:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-17 11:54:41,258 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.8732394366197185) internal successors, (204), 70 states have internal predecessors, (204), 0 states have call successors, (0), 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 99 [2025-03-17 11:54:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:41,259 INFO L225 Difference]: With dead ends: 400 [2025-03-17 11:54:41,259 INFO L226 Difference]: Without dead ends: 400 [2025-03-17 11:54:41,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6306 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9097, Invalid=17635, Unknown=0, NotChecked=0, Total=26732 [2025-03-17 11:54:41,263 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1544 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:41,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 110 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:54:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-17 11:54:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 310. [2025-03-17 11:54:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 300 states have (on average 1.04) internal successors, (312), 309 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 312 transitions. [2025-03-17 11:54:41,269 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 312 transitions. Word has length 99 [2025-03-17 11:54:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:41,270 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 312 transitions. [2025-03-17 11:54:41,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.8732394366197185) internal successors, (204), 70 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 312 transitions. [2025-03-17 11:54:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-17 11:54:41,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:41,272 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2025-03-17 11:54:41,278 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-03-17 11:54:41,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 11:54:41,472 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:41,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1511556011, now seen corresponding path program 1 times [2025-03-17 11:54:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100280566] [2025-03-17 11:54:41,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:41,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-17 11:54:41,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-17 11:54:41,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:41,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-17 11:54:44,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:44,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100280566] [2025-03-17 11:54:44,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100280566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:54:44,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153447029] [2025-03-17 11:54:44,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:44,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:54:44,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:54:44,354 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-03-17 11:54:44,355 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-03-17 11:54:44,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-17 11:54:44,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-17 11:54:44,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:44,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:44,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-17 11:54:44,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:54:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-17 11:54:46,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:54:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-17 11:54:49,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153447029] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:54:49,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:54:49,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 192 [2025-03-17 11:54:49,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831501061] [2025-03-17 11:54:49,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:54:49,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2025-03-17 11:54:49,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:49,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2025-03-17 11:54:49,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16387, Invalid=20669, Unknown=0, NotChecked=0, Total=37056 [2025-03-17 11:54:49,734 INFO L87 Difference]: Start difference. First operand 310 states and 312 transitions. Second operand has 193 states, 193 states have (on average 2.9689119170984455) internal successors, (573), 192 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:56,775 INFO L93 Difference]: Finished difference Result 784 states and 848 transitions. [2025-03-17 11:54:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-17 11:54:56,775 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 2.9689119170984455) internal successors, (573), 192 states have internal predecessors, (573), 0 states have call successors, (0), 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 285 [2025-03-17 11:54:56,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:56,778 INFO L225 Difference]: With dead ends: 784 [2025-03-17 11:54:56,778 INFO L226 Difference]: Without dead ends: 784 [2025-03-17 11:54:56,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23937 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=24640, Invalid=40640, Unknown=0, NotChecked=0, Total=65280 [2025-03-17 11:54:56,781 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2409 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:56,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2409 Valid, 164 Invalid, 1687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 11:54:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-03-17 11:54:56,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 598. [2025-03-17 11:54:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 588 states have (on average 1.0204081632653061) internal successors, (600), 597 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 600 transitions. [2025-03-17 11:54:56,793 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 600 transitions. Word has length 285 [2025-03-17 11:54:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:56,793 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 600 transitions. [2025-03-17 11:54:56,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 2.9689119170984455) internal successors, (573), 192 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:54:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 600 transitions. [2025-03-17 11:54:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-17 11:54:56,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:56,800 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2025-03-17 11:54:56,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 11:54:57,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:54:57,000 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:54:57,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:57,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1450570667, now seen corresponding path program 2 times [2025-03-17 11:54:57,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:57,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247230793] [2025-03-17 11:54:57,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:54:57,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:57,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 573 statements into 2 equivalence classes. [2025-03-17 11:54:57,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 573 of 573 statements. [2025-03-17 11:54:57,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:54:57,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 23751 trivial. 0 not checked. [2025-03-17 11:55:00,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:00,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247230793] [2025-03-17 11:55:00,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247230793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:00,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696342524] [2025-03-17 11:55:00,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:55:00,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:00,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:00,551 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-03-17 11:55:00,552 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-03-17 11:55:00,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 573 statements into 2 equivalence classes. [2025-03-17 11:55:00,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 573 of 573 statements. [2025-03-17 11:55:00,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:55:00,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:00,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 2140 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-03-17 11:55:00,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2025-03-17 11:55:06,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2025-03-17 11:55:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696342524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:13,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 129, 129] total 322 [2025-03-17 11:55:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611663376] [2025-03-17 11:55:13,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:13,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 322 states [2025-03-17 11:55:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:13,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 322 interpolants. [2025-03-17 11:55:13,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29247, Invalid=74115, Unknown=0, NotChecked=0, Total=103362 [2025-03-17 11:55:13,774 INFO L87 Difference]: Start difference. First operand 598 states and 600 transitions. Second operand has 322 states, 322 states have (on average 3.0) internal successors, (966), 322 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:23,046 INFO L93 Difference]: Finished difference Result 796 states and 798 transitions. [2025-03-17 11:55:23,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-03-17 11:55:23,047 INFO L78 Accepts]: Start accepts. Automaton has has 322 states, 322 states have (on average 3.0) internal successors, (966), 322 states have internal predecessors, (966), 0 states have call successors, (0), 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 573 [2025-03-17 11:55:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:23,049 INFO L225 Difference]: With dead ends: 796 [2025-03-17 11:55:23,049 INFO L226 Difference]: Without dead ends: 796 [2025-03-17 11:55:23,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1214 GetRequests, 892 SyntacticMatches, 0 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56640 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=29702, Invalid=74950, Unknown=0, NotChecked=0, Total=104652 [2025-03-17 11:55:23,052 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1653 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 874 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 874 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:23,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1653 Valid, 305 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [874 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 11:55:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-17 11:55:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2025-03-17 11:55:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 786 states have (on average 1.015267175572519) internal successors, (798), 795 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 798 transitions. [2025-03-17 11:55:23,063 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 798 transitions. Word has length 573 [2025-03-17 11:55:23,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:23,064 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 798 transitions. [2025-03-17 11:55:23,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 322 states, 322 states have (on average 3.0) internal successors, (966), 322 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 798 transitions. [2025-03-17 11:55:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2025-03-17 11:55:23,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:23,073 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 127, 127, 127, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:23,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 11:55:23,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:23,278 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-17 11:55:23,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1416431851, now seen corresponding path program 3 times [2025-03-17 11:55:23,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:23,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437573545] [2025-03-17 11:55:23,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:55:23,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:23,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 771 statements into 129 equivalence classes. [2025-03-17 11:55:25,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 129 check-sat command(s) and asserted 771 of 771 statements. [2025-03-17 11:55:25,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 129 check-sat command(s) [2025-03-17 11:55:25,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:55:25,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:55:25,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 771 statements into 1 equivalence classes. [2025-03-17 11:55:25,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 771 of 771 statements. [2025-03-17 11:55:25,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:25,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:55:25,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:55:25,383 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:55:25,384 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2025-03-17 11:55:25,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 21 remaining) [2025-03-17 11:55:25,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (18 of 21 remaining) [2025-03-17 11:55:25,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (17 of 21 remaining) [2025-03-17 11:55:25,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (16 of 21 remaining) [2025-03-17 11:55:25,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (15 of 21 remaining) [2025-03-17 11:55:25,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (14 of 21 remaining) [2025-03-17 11:55:25,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (13 of 21 remaining) [2025-03-17 11:55:25,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (12 of 21 remaining) [2025-03-17 11:55:25,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2025-03-17 11:55:25,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2025-03-17 11:55:25,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2025-03-17 11:55:25,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2025-03-17 11:55:25,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2025-03-17 11:55:25,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2025-03-17 11:55:25,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2025-03-17 11:55:25,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2025-03-17 11:55:25,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2025-03-17 11:55:25,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2025-03-17 11:55:25,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2025-03-17 11:55:25,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2025-03-17 11:55:25,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:55:25,391 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:25,606 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:55:25,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:55:25 BoogieIcfgContainer [2025-03-17 11:55:25,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:55:25,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:55:25,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:55:25,611 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:55:25,612 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:54:27" (3/4) ... [2025-03-17 11:55:25,612 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 11:55:25,757 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 260. [2025-03-17 11:55:25,871 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:55:25,871 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:55:25,871 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:55:25,872 INFO L158 Benchmark]: Toolchain (without parser) took 58739.57ms. Allocated memory was 142.6MB in the beginning and 981.5MB in the end (delta: 838.9MB). Free memory was 111.8MB in the beginning and 378.4MB in the end (delta: -266.6MB). Peak memory consumption was 568.5MB. Max. memory is 16.1GB. [2025-03-17 11:55:25,872 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:55:25,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.10ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 94.8MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:55:25,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.82ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:55:25,872 INFO L158 Benchmark]: Boogie Preprocessor took 24.08ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:55:25,872 INFO L158 Benchmark]: IcfgBuilder took 278.42ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 77.4MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:55:25,873 INFO L158 Benchmark]: TraceAbstraction took 57845.59ms. Allocated memory was 142.6MB in the beginning and 981.5MB in the end (delta: 838.9MB). Free memory was 76.4MB in the beginning and 420.3MB in the end (delta: -343.9MB). Peak memory consumption was 501.4MB. Max. memory is 16.1GB. [2025-03-17 11:55:25,873 INFO L158 Benchmark]: Witness Printer took 261.04ms. Allocated memory is still 981.5MB. Free memory was 420.3MB in the beginning and 378.4MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 11:55:25,875 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.10ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 94.8MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.82ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.08ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 278.42ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 77.4MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 57845.59ms. Allocated memory was 142.6MB in the beginning and 981.5MB in the end (delta: 838.9MB). Free memory was 76.4MB in the beginning and 420.3MB in the end (delta: -343.9MB). Peak memory consumption was 501.4MB. Max. memory is 16.1GB. * Witness Printer took 261.04ms. Allocated memory is still 981.5MB. Free memory was 420.3MB in the beginning and 378.4MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L523] int *a, *b; [L524] int n; [L535] n = 128 [L536] a = malloc (n * sizeof(*a)) [L537] b = malloc (n * sizeof(*b)) [L538] EXPR b++ VAL [a={-3:0}, b={-2:4}, n=128] [L538] *b++ = 0 VAL [a={-3:0}, b={-2:4}, n=128] [L539] CALL foo () [L527] int i; [L528] i = 0 VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=127, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=128, n=128] [L528] COND FALSE !(i < n) [L530] i = 0 VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=127, n=128] [L530] COND FALSE !(i < 128 - 1) [L539] RET foo () [L540] b[-2] - UnprovableResult [Line: 533]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 50 edges, 21 error locations. Started 1 CEGAR loops. OverallTime: 57.6s, OverallIterations: 15, TraceHistogramMax: 128, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6965 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6965 mSDsluCounter, 1578 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1182 mSDsCounter, 2256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3994 IncrementalHoareTripleChecker+Invalid, 6250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2256 mSolverCounterUnsat, 396 mSDtfsCounter, 3994 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2489 GetRequests, 1593 SyntacticMatches, 0 SemanticMatches, 896 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88837 ImplicationChecksByTransitivity, 29.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=796occurred in iteration=14, InterpolantAutomatonStates: 449, 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, 14 MinimizatonAttempts, 354 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 29.6s InterpolantComputationTime, 2977 NumberOfCodeBlocks, 2935 NumberOfCodeBlocksAsserted, 156 NumberOfCheckSat, 3235 ConstructedInterpolants, 22 QuantifiedInterpolants, 16883 SizeOfPredicates, 4 NumberOfNonLiveVariables, 4150 ConjunctsInSsa, 287 ConjunctsInUnsatCore, 28 InterpolantComputations, 7 PerfectInterpolantSequences, 41596/115955 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-17 11:55:25,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)