./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 22:47:00,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:47:00,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:47:00,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:47:00,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:47:00,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:47:00,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:47:00,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:47:00,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:47:00,999 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:47:01,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:47:01,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:47:01,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:47:01,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:47:01,000 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:47:01,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:47:01,001 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:47:01,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:47:01,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:47:01,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:47:01,001 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:47:01,001 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:47:01,001 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:47:01,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:47:01,001 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:47:01,001 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:47:01,002 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:47:01,002 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:47:01,002 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:47:01,002 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:47:01,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:47:01,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:47:01,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:47:01,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:47:01,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:47:01,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:47:01,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:47:01,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:47:01,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:47:01,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:47:01,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:47:01,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:47:01,003 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-08 22:47:01,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:47:01,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:47:01,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:47:01,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:47:01,229 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:47:01,231 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-08 22:47:02,321 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/071674010/c6f5e378bbb947a2bb93d49481475032/FLAGedd0570ed [2025-03-08 22:47:02,558 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:47:02,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/960521-1-3.i [2025-03-08 22:47:02,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/071674010/c6f5e378bbb947a2bb93d49481475032/FLAGedd0570ed [2025-03-08 22:47:02,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/071674010/c6f5e378bbb947a2bb93d49481475032 [2025-03-08 22:47:02,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:47:02,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:47:02,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:47:02,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:47:02,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:47:02,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:47:02" (1/1) ... [2025-03-08 22:47:02,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372d6db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:02, skipping insertion in model container [2025-03-08 22:47:02,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:47:02" (1/1) ... [2025-03-08 22:47:02,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:47:03,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:47:03,122 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:47:03,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:47:03,184 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:47:03,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03 WrapperNode [2025-03-08 22:47:03,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:47:03,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:47:03,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:47:03,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:47:03,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,219 INFO L138 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-03-08 22:47:03,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:47:03,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:47:03,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:47:03,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:47:03,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,241 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-08 22:47:03,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:47:03,252 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:47:03,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:47:03,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:47:03,253 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (1/1) ... [2025-03-08 22:47:03,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:47:03,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:03,274 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-08 22:47:03,276 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-08 22:47:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:47:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:47:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 22:47:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:47:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:47:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:47:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:47:03,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:47:03,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:47:03,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:47:03,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:47:03,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:47:03,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:47:03,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:47:03,354 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:47:03,355 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:47:03,469 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 22:47:03,469 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:47:03,475 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:47:03,475 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:47:03,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:47:03 BoogieIcfgContainer [2025-03-08 22:47:03,476 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:47:03,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:47:03,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:47:03,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:47:03,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:47:02" (1/3) ... [2025-03-08 22:47:03,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67274c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:47:03, skipping insertion in model container [2025-03-08 22:47:03,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:03" (2/3) ... [2025-03-08 22:47:03,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67274c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:47:03, skipping insertion in model container [2025-03-08 22:47:03,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:47:03" (3/3) ... [2025-03-08 22:47:03,482 INFO L128 eAbstractionObserver]: Analyzing ICFG 960521-1-3.i [2025-03-08 22:47:03,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:47:03,492 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 960521-1-3.i that has 1 procedures, 50 locations, 1 initial locations, 2 loop locations, and 21 error locations. [2025-03-08 22:47:03,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:47:03,521 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;@297c1b54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:47:03,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-08 22:47:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:47:03,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:03,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:47:03,528 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-08 22:47:03,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash 80400, now seen corresponding path program 1 times [2025-03-08 22:47:03,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:03,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625094328] [2025-03-08 22:47:03,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:03,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:47:03,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:47:03,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:03,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:03,678 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-08 22:47:03,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:03,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625094328] [2025-03-08 22:47:03,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625094328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:03,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:03,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:47:03,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971974366] [2025-03-08 22:47:03,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:03,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:47:03,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:03,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:47:03,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:03,701 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:03,746 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-03-08 22:47:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:03,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-08 22:47:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:03,751 INFO L225 Difference]: With dead ends: 49 [2025-03-08 22:47:03,751 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 22:47:03,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:03,754 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:03,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:03,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 22:47:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-08 22:47:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-03-08 22:47:03,775 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2025-03-08 22:47:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:03,775 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-03-08 22:47:03,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-03-08 22:47:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:47:03,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:03,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:47:03,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:47:03,775 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-08 22:47:03,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash 80401, now seen corresponding path program 1 times [2025-03-08 22:47:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:03,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179628745] [2025-03-08 22:47:03,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:03,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:47:03,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:47:03,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:03,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:03,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:03,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179628745] [2025-03-08 22:47:03,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179628745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:03,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:03,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:47:03,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662399314] [2025-03-08 22:47:03,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:03,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:47:03,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:03,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:47:03,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:03,879 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:03,899 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2025-03-08 22:47:03,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:03,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-08 22:47:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:03,900 INFO L225 Difference]: With dead ends: 46 [2025-03-08 22:47:03,900 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 22:47:03,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:03,901 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:03,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 22:47:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 22:47:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2025-03-08 22:47:03,905 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 3 [2025-03-08 22:47:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:03,906 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2025-03-08 22:47:03,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2025-03-08 22:47:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:47:03,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:03,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:47:03,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:47:03,907 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-08 22:47:03,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:03,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1899755043, now seen corresponding path program 1 times [2025-03-08 22:47:03,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:03,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111583881] [2025-03-08 22:47:03,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:03,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:03,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:47:03,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:47:03,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:03,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:03,996 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-08 22:47:03,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111583881] [2025-03-08 22:47:03,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111583881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:03,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:03,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:47:03,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768271839] [2025-03-08 22:47:03,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:03,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:47:03,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:03,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:47:03,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:03,999 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:04,042 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2025-03-08 22:47:04,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:04,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:47:04,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:04,043 INFO L225 Difference]: With dead ends: 43 [2025-03-08 22:47:04,043 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 22:47:04,043 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-08 22:47:04,044 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:04,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 50 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 22:47:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 22:47:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 42 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-08 22:47:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2025-03-08 22:47:04,046 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 6 [2025-03-08 22:47:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:04,046 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2025-03-08 22:47:04,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2025-03-08 22:47:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:47:04,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:04,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:47:04,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:47:04,048 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-08 22:47:04,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1899755042, now seen corresponding path program 1 times [2025-03-08 22:47:04,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:04,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080820566] [2025-03-08 22:47:04,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:04,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:04,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:47:04,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:47:04,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:04,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:04,213 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-08 22:47:04,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:04,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080820566] [2025-03-08 22:47:04,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080820566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:04,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:04,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:47:04,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820859903] [2025-03-08 22:47:04,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:04,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:47:04,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:04,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:47:04,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:47:04,215 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:04,292 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-03-08 22:47:04,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:47:04,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:47:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:04,293 INFO L225 Difference]: With dead ends: 48 [2025-03-08 22:47:04,293 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 22:47:04,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-08 22:47:04,294 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:04,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 61 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 22:47:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-03-08 22:47:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 43 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-08 22:47:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-03-08 22:47:04,297 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 6 [2025-03-08 22:47:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:04,297 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-03-08 22:47:04,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-03-08 22:47:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:47:04,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:04,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:04,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:47:04,298 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-08 22:47:04,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1237130887, now seen corresponding path program 1 times [2025-03-08 22:47:04,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:04,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363893879] [2025-03-08 22:47:04,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:04,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:04,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:47:04,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:47:04,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:04,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:04,335 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-08 22:47:04,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:04,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363893879] [2025-03-08 22:47:04,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363893879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:04,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:04,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:47:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955641620] [2025-03-08 22:47:04,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:04,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:47:04,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:04,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:47:04,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:04,337 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:04,357 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-03-08 22:47:04,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:47:04,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:47:04,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:04,358 INFO L225 Difference]: With dead ends: 48 [2025-03-08 22:47:04,358 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 22:47:04,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:04,358 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 52 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:04,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 64 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:04,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 22:47:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-03-08 22:47:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.5333333333333334) 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-08 22:47:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2025-03-08 22:47:04,362 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 7 [2025-03-08 22:47:04,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:04,362 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2025-03-08 22:47:04,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2025-03-08 22:47:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:47:04,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:04,362 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:04,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:47:04,362 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-08 22:47:04,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:04,363 INFO L85 PathProgramCache]: Analyzing trace with hash -818415572, now seen corresponding path program 1 times [2025-03-08 22:47:04,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:04,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591932450] [2025-03-08 22:47:04,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:04,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:04,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:47:04,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:47:04,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:04,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:04,610 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-08 22:47:04,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:04,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591932450] [2025-03-08 22:47:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591932450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:04,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42636956] [2025-03-08 22:47:04,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:04,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:04,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:04,615 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-08 22:47:04,616 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-08 22:47:04,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:47:04,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:47:04,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:04,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:04,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 22:47:04,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:04,708 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:47:04,708 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-08 22:47:04,847 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-08 22:47:04,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:04,951 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-08 22:47:04,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42636956] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:04,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:04,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-03-08 22:47:04,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522372966] [2025-03-08 22:47:04,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:04,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:47:04,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:04,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:47:04,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:47:04,953 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:05,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:05,222 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2025-03-08 22:47:05,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:47:05,222 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 22:47:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:05,223 INFO L225 Difference]: With dead ends: 61 [2025-03-08 22:47:05,223 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 22:47:05,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:47:05,223 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 198 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:05,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 101 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 22:47:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-03-08 22:47:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-03-08 22:47:05,227 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 9 [2025-03-08 22:47:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:05,227 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-03-08 22:47:05,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-03-08 22:47:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:47:05,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:05,228 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2025-03-08 22:47:05,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:47:05,428 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-08 22:47:05,428 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-08 22:47:05,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:05,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1876917154, now seen corresponding path program 2 times [2025-03-08 22:47:05,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:05,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784812544] [2025-03-08 22:47:05,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:05,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:05,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 22:47:05,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:47:05,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:05,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:05,785 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-08 22:47:05,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:05,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784812544] [2025-03-08 22:47:05,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784812544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:05,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893840133] [2025-03-08 22:47:05,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:05,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:05,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:05,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:05,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:47:05,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 22:47:05,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:47:05,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:05,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:05,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 22:47:05,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:05,861 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-03-08 22:47:05,861 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-08 22:47:06,243 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-08 22:47:06,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:06,562 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-08 22:47:06,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893840133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:06,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:06,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-03-08 22:47:06,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545796983] [2025-03-08 22:47:06,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:06,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 22:47:06,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:06,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 22:47:06,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:47:06,564 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:07,079 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2025-03-08 22:47:07,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:47:07,080 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 22:47:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:07,082 INFO L225 Difference]: With dead ends: 77 [2025-03-08 22:47:07,083 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 22:47:07,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 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-08 22:47:07,083 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 301 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:07,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 141 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:47:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 22:47:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2025-03-08 22:47:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 68 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2025-03-08 22:47:07,090 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 18 [2025-03-08 22:47:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:07,090 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-03-08 22:47:07,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2025-03-08 22:47:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:47:07,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:07,090 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:07,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:47:07,292 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-08 22:47:07,292 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-08 22:47:07,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:07,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1140573895, now seen corresponding path program 1 times [2025-03-08 22:47:07,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:07,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790686780] [2025-03-08 22:47:07,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:07,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:47:07,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:47:07,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:07,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:07,337 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-08 22:47:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790686780] [2025-03-08 22:47:07,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790686780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:07,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:07,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:47:07,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108795461] [2025-03-08 22:47:07,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:07,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:47:07,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:07,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:47:07,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:07,340 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:07,372 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2025-03-08 22:47:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:47:07,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 22:47:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:07,372 INFO L225 Difference]: With dead ends: 67 [2025-03-08 22:47:07,373 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 22:47:07,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:47:07,373 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 15 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:07,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 57 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 22:47:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 22:47:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-08 22:47:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2025-03-08 22:47:07,376 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 25 [2025-03-08 22:47:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:07,376 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2025-03-08 22:47:07,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2025-03-08 22:47:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:47:07,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:07,378 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:07,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:47:07,378 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-08 22:47:07,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:07,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1140573896, now seen corresponding path program 1 times [2025-03-08 22:47:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:07,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479137616] [2025-03-08 22:47:07,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:07,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:07,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:47:07,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:47:07,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:07,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:07,500 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-08 22:47:07,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:07,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479137616] [2025-03-08 22:47:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479137616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:07,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943452953] [2025-03-08 22:47:07,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:07,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:07,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:07,502 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-08 22:47:07,504 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-08 22:47:07,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:47:07,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:47:07,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:07,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:07,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:47:07,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:07,668 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-08 22:47:07,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:07,763 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-08 22:47:07,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943452953] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:07,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:07,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-08 22:47:07,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121047232] [2025-03-08 22:47:07,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:07,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 22:47:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:07,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 22:47:07,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:47:07,765 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:07,968 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2025-03-08 22:47:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:47:07,968 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 22:47:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:07,969 INFO L225 Difference]: With dead ends: 115 [2025-03-08 22:47:07,969 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 22:47:07,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 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-08 22:47:07,970 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 252 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:07,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 112 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:07,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 22:47:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2025-03-08 22:47:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-08 22:47:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2025-03-08 22:47:07,976 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 25 [2025-03-08 22:47:07,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:07,977 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2025-03-08 22:47:07,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2025-03-08 22:47:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 22:47:07,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:07,977 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:07,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:47:08,183 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-08 22:47:08,183 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-08 22:47:08,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:08,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2014809656, now seen corresponding path program 2 times [2025-03-08 22:47:08,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:08,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899406858] [2025-03-08 22:47:08,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:08,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 22:47:08,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 49 statements. [2025-03-08 22:47:08,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:47:08,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:08,291 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-08 22:47:08,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:08,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899406858] [2025-03-08 22:47:08,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899406858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:08,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:08,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:47:08,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624338639] [2025-03-08 22:47:08,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:08,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:47:08,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:08,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:47:08,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:47:08,292 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:08,375 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2025-03-08 22:47:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:47:08,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 22:47:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:08,376 INFO L225 Difference]: With dead ends: 97 [2025-03-08 22:47:08,376 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 22:47:08,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:47:08,376 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:08,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 43 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 22:47:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-08 22:47:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 96 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-08 22:47:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2025-03-08 22:47:08,383 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 49 [2025-03-08 22:47:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:08,384 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2025-03-08 22:47:08,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2025-03-08 22:47:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 22:47:08,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:08,384 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:08,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:47:08,385 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-08 22:47:08,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1026525989, now seen corresponding path program 1 times [2025-03-08 22:47:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:08,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277776205] [2025-03-08 22:47:08,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:08,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:08,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:47:08,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:47:08,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:08,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:08,703 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-08 22:47:08,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277776205] [2025-03-08 22:47:08,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277776205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587296147] [2025-03-08 22:47:08,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:08,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:08,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:08,705 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-08 22:47:08,706 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-08 22:47:08,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:47:08,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:47:08,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:08,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:08,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 22:47:08,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:09,042 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-08 22:47:09,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:09,400 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-08 22:47:09,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587296147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:09,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:09,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2025-03-08 22:47:09,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800351316] [2025-03-08 22:47:09,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:09,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 22:47:09,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:09,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 22:47:09,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=1325, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 22:47:09,402 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 49 states, 49 states have (on average 2.877551020408163) internal successors, (141), 49 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-08 22:47:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:09,872 INFO L93 Difference]: Finished difference Result 211 states and 254 transitions. [2025-03-08 22:47:09,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 22:47:09,872 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.877551020408163) internal successors, (141), 49 states have internal predecessors, (141), 0 states have call successors, (0), 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 52 [2025-03-08 22:47:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:09,873 INFO L225 Difference]: With dead ends: 211 [2025-03-08 22:47:09,873 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 22:47:09,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 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-08 22:47:09,874 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 366 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:09,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 139 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 22:47:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 169. [2025-03-08 22:47:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 158 states have (on average 1.1645569620253164) internal successors, (184), 168 states have internal predecessors, (184), 0 states have call successors, (0), 0 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-08 22:47:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 184 transitions. [2025-03-08 22:47:09,878 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 184 transitions. Word has length 52 [2025-03-08 22:47:09,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:09,878 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 184 transitions. [2025-03-08 22:47:09,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.877551020408163) internal successors, (141), 49 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-08 22:47:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 184 transitions. [2025-03-08 22:47:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 22:47:09,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:09,880 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:09,886 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-08 22:47:10,084 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-08 22:47:10,084 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-08 22:47:10,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:10,084 INFO L85 PathProgramCache]: Analyzing trace with hash -419275045, now seen corresponding path program 2 times [2025-03-08 22:47:10,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:10,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968572680] [2025-03-08 22:47:10,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:10,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:10,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-08 22:47:10,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 22:47:10,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:10,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:10,544 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-08 22:47:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968572680] [2025-03-08 22:47:10,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968572680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120534304] [2025-03-08 22:47:10,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:10,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:10,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:10,548 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-08 22:47:10,549 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-08 22:47:10,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-08 22:47:10,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 22:47:10,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:10,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:10,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 22:47:10,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:11,274 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-08 22:47:11,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:12,163 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-08 22:47:12,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120534304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:12,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 34, 34] total 71 [2025-03-08 22:47:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122814025] [2025-03-08 22:47:12,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:12,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-08 22:47:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:12,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-08 22:47:12,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2100, Invalid=2870, Unknown=0, NotChecked=0, Total=4970 [2025-03-08 22:47:12,166 INFO L87 Difference]: Start difference. First operand 169 states and 184 transitions. Second operand has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 71 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-08 22:47:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:17,058 INFO L93 Difference]: Finished difference Result 402 states and 434 transitions. [2025-03-08 22:47:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-08 22:47:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 71 states have internal predecessors, (205), 0 states have call successors, (0), 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 100 [2025-03-08 22:47:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:17,060 INFO L225 Difference]: With dead ends: 402 [2025-03-08 22:47:17,060 INFO L226 Difference]: Without dead ends: 402 [2025-03-08 22:47:17,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6458 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8917, Invalid=17815, Unknown=0, NotChecked=0, Total=26732 [2025-03-08 22:47:17,064 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1046 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:17,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 101 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:47:17,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-08 22:47:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 312. [2025-03-08 22:47:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 302 states have (on average 1.0397350993377483) internal successors, (314), 311 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-08 22:47:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 314 transitions. [2025-03-08 22:47:17,070 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 314 transitions. Word has length 100 [2025-03-08 22:47:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:17,070 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 314 transitions. [2025-03-08 22:47:17,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 71 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-08 22:47:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 314 transitions. [2025-03-08 22:47:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-08 22:47:17,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:17,073 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:17,079 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-08 22:47:17,276 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-08 22:47:17,277 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-08 22:47:17,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:17,277 INFO L85 PathProgramCache]: Analyzing trace with hash 268767946, now seen corresponding path program 1 times [2025-03-08 22:47:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:17,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134411068] [2025-03-08 22:47:17,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:17,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:17,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-08 22:47:17,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-08 22:47:17,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:17,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:20,164 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-08 22:47:20,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:20,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134411068] [2025-03-08 22:47:20,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134411068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:20,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998765053] [2025-03-08 22:47:20,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:20,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:20,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:20,166 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-08 22:47:20,167 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-08 22:47:20,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-08 22:47:20,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-08 22:47:20,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:20,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:20,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-08 22:47:20,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:21,918 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-08 22:47:21,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:25,392 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-08 22:47:25,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998765053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:25,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:25,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 193 [2025-03-08 22:47:25,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617508345] [2025-03-08 22:47:25,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:25,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2025-03-08 22:47:25,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:25,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2025-03-08 22:47:25,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16387, Invalid=20669, Unknown=0, NotChecked=0, Total=37056 [2025-03-08 22:47:25,400 INFO L87 Difference]: Start difference. First operand 312 states and 314 transitions. Second operand has 193 states, 193 states have (on average 2.9792746113989637) internal successors, (575), 193 states have internal predecessors, (575), 0 states have call successors, (0), 0 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-08 22:47:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:31,894 INFO L93 Difference]: Finished difference Result 786 states and 850 transitions. [2025-03-08 22:47:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-08 22:47:31,895 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 2.9792746113989637) internal successors, (575), 193 states have internal predecessors, (575), 0 states have call successors, (0), 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 287 [2025-03-08 22:47:31,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:31,897 INFO L225 Difference]: With dead ends: 786 [2025-03-08 22:47:31,897 INFO L226 Difference]: Without dead ends: 786 [2025-03-08 22:47:31,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23937 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=24640, Invalid=40640, Unknown=0, NotChecked=0, Total=65280 [2025-03-08 22:47:31,900 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2411 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2411 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:31,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2411 Valid, 166 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 22:47:31,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-03-08 22:47:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 600. [2025-03-08 22:47:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 590 states have (on average 1.0203389830508474) internal successors, (602), 599 states have internal predecessors, (602), 0 states have call successors, (0), 0 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-08 22:47:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 602 transitions. [2025-03-08 22:47:31,909 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 602 transitions. Word has length 287 [2025-03-08 22:47:31,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:31,909 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 602 transitions. [2025-03-08 22:47:31,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 2.9792746113989637) internal successors, (575), 193 states have internal predecessors, (575), 0 states have call successors, (0), 0 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-08 22:47:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 602 transitions. [2025-03-08 22:47:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 22:47:31,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:31,918 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:31,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 22:47:32,119 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-08 22:47:32,119 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-08 22:47:32,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1991761098, now seen corresponding path program 2 times [2025-03-08 22:47:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:32,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175884925] [2025-03-08 22:47:32,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:32,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:32,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 575 statements into 2 equivalence classes. [2025-03-08 22:47:32,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 22:47:32,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:32,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:35,743 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-08 22:47:35,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:35,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175884925] [2025-03-08 22:47:35,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175884925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:35,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606026676] [2025-03-08 22:47:35,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:35,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:35,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:35,746 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-08 22:47:35,746 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-08 22:47:35,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 575 statements into 2 equivalence classes. [2025-03-08 22:47:36,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 22:47:36,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:36,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:36,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 2151 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-03-08 22:47:36,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:41,304 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-08 22:47:41,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:48,529 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-08 22:47:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606026676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:48,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:48,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 130, 130] total 322 [2025-03-08 22:47:48,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863904737] [2025-03-08 22:47:48,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:48,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 322 states [2025-03-08 22:47:48,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:48,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 322 interpolants. [2025-03-08 22:47:48,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29247, Invalid=74115, Unknown=0, NotChecked=0, Total=103362 [2025-03-08 22:47:48,543 INFO L87 Difference]: Start difference. First operand 600 states and 602 transitions. Second operand has 322 states, 322 states have (on average 3.0062111801242235) internal successors, (968), 322 states have internal predecessors, (968), 0 states have call successors, (0), 0 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-08 22:47:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:56,201 INFO L93 Difference]: Finished difference Result 798 states and 800 transitions. [2025-03-08 22:47:56,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-03-08 22:47:56,202 INFO L78 Accepts]: Start accepts. Automaton has has 322 states, 322 states have (on average 3.0062111801242235) internal successors, (968), 322 states have internal predecessors, (968), 0 states have call successors, (0), 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 575 [2025-03-08 22:47:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:56,205 INFO L225 Difference]: With dead ends: 798 [2025-03-08 22:47:56,205 INFO L226 Difference]: Without dead ends: 798 [2025-03-08 22:47:56,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1218 GetRequests, 896 SyntacticMatches, 0 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56640 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=29702, Invalid=74950, Unknown=0, NotChecked=0, Total=104652 [2025-03-08 22:47:56,208 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1518 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 2357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:56,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 504 Invalid, 2357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 22:47:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-08 22:47:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2025-03-08 22:47:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 788 states have (on average 1.015228426395939) internal successors, (800), 797 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-08 22:47:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 800 transitions. [2025-03-08 22:47:56,217 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 800 transitions. Word has length 575 [2025-03-08 22:47:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:56,221 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 800 transitions. [2025-03-08 22:47:56,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 322 states, 322 states have (on average 3.0062111801242235) internal successors, (968), 322 states have internal predecessors, (968), 0 states have call successors, (0), 0 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-08 22:47:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 800 transitions. [2025-03-08 22:47:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2025-03-08 22:47:56,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:56,231 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:56,240 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-08 22:47:56,431 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-08 22:47:56,432 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-08 22:47:56,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:56,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1436585078, now seen corresponding path program 3 times [2025-03-08 22:47:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:56,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046118672] [2025-03-08 22:47:56,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:47:56,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:56,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 773 statements into 129 equivalence classes. [2025-03-08 22:47:58,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 129 check-sat command(s) and asserted 773 of 773 statements. [2025-03-08 22:47:58,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 129 check-sat command(s) [2025-03-08 22:47:58,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:47:58,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:47:58,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 773 statements into 1 equivalence classes. [2025-03-08 22:47:58,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 773 of 773 statements. [2025-03-08 22:47:58,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:58,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:47:58,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:47:58,392 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:47:58,393 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2025-03-08 22:47:58,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 21 remaining) [2025-03-08 22:47:58,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (18 of 21 remaining) [2025-03-08 22:47:58,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (17 of 21 remaining) [2025-03-08 22:47:58,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (16 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (15 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (14 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (13 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (12 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2025-03-08 22:47:58,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2025-03-08 22:47:58,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2025-03-08 22:47:58,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2025-03-08 22:47:58,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2025-03-08 22:47:58,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:47:58,398 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:58,607 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:47:58,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:47:58 BoogieIcfgContainer [2025-03-08 22:47:58,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:47:58,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:47:58,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:47:58,610 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:47:58,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:47:03" (3/4) ... [2025-03-08 22:47:58,611 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 22:47:58,787 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 260. [2025-03-08 22:47:58,914 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:47:58,915 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:47:58,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:47:58,915 INFO L158 Benchmark]: Toolchain (without parser) took 56026.77ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 120.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2025-03-08 22:47:58,915 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:47:58,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.05ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 103.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:47:58,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.06ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 101.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:47:58,916 INFO L158 Benchmark]: Boogie Preprocessor took 30.17ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 100.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:47:58,916 INFO L158 Benchmark]: IcfgBuilder took 224.03ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 85.1MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:47:58,916 INFO L158 Benchmark]: TraceAbstraction took 55132.64ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 85.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 468.9MB. Max. memory is 16.1GB. [2025-03-08 22:47:58,917 INFO L158 Benchmark]: Witness Printer took 304.62ms. Allocated memory is still 1.2GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 22:47:58,918 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.25ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.05ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 103.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.06ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 101.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.17ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 100.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 224.03ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 85.1MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 55132.64ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 85.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 468.9MB. Max. memory is 16.1GB. * Witness Printer took 304.62ms. Allocated memory is still 1.2GB. Free memory was 1.2GB in the beginning and 1.1GB 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; VAL [a={0:0}, b={0:0}, n=0] [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) VAL [a={-3:0}, b={-2:4}, n=128] [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, 50 locations, 52 edges, 21 error locations. Started 1 CEGAR loops. OverallTime: 54.9s, OverallIterations: 15, TraceHistogramMax: 128, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6273 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6273 mSDsluCounter, 1703 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1280 mSDsCounter, 2091 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4145 IncrementalHoareTripleChecker+Invalid, 6236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2091 mSolverCounterUnsat, 423 mSDtfsCounter, 4145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2521 GetRequests, 1624 SyntacticMatches, 0 SemanticMatches, 897 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88998 ImplicationChecksByTransitivity, 29.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=798occurred in iteration=14, InterpolantAutomatonStates: 452, 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.1s SatisfiabilityAnalysisTime, 29.1s InterpolantComputationTime, 3004 NumberOfCodeBlocks, 2962 NumberOfCodeBlocksAsserted, 156 NumberOfCheckSat, 3269 ConstructedInterpolants, 22 QuantifiedInterpolants, 18532 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4222 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-08 22:47:58,953 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)