./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-15/array04_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-15/array04_alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1183c091737a27abb58fd8d0696c96a2bb1d5baea63debedec24831694536a86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:41:18,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:41:18,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 01:41:18,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:41:18,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:41:18,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:41:18,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:41:18,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:41:18,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:41:18,342 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:41:18,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:41:18,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:41:18,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:41:18,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:41:18,346 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:41:18,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:41:18,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:41:18,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:41:18,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:41:18,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:41:18,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:41:18,348 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:41:18,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:41:18,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:41:18,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:41:18,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:41:18,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:41:18,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:41:18,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:41:18,348 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-jdk21/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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1183c091737a27abb58fd8d0696c96a2bb1d5baea63debedec24831694536a86 [2025-01-10 01:41:18,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:41:18,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:41:18,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:41:18,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:41:18,599 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:41:18,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array04_alloca.i [2025-01-10 01:41:19,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf6549090/db10fa00be7549e49eb2e2e3bc7ed770/FLAG135b9da56 [2025-01-10 01:41:20,095 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:41:20,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-15/array04_alloca.i [2025-01-10 01:41:20,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf6549090/db10fa00be7549e49eb2e2e3bc7ed770/FLAG135b9da56 [2025-01-10 01:41:20,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf6549090/db10fa00be7549e49eb2e2e3bc7ed770 [2025-01-10 01:41:20,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:41:20,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:41:20,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:41:20,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:41:20,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:41:20,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ade447e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20, skipping insertion in model container [2025-01-10 01:41:20,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:41:20,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:41:20,563 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:41:20,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:41:20,620 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:41:20,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20 WrapperNode [2025-01-10 01:41:20,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:41:20,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:41:20,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:41:20,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:41:20,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,640 INFO L138 Inliner]: procedures = 151, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2025-01-10 01:41:20,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:41:20,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:41:20,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:41:20,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:41:20,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,653 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2025-01-10 01:41:20,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:41:20,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:41:20,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:41:20,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:41:20,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (1/1) ... [2025-01-10 01:41:20,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:41:20,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:41:20,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:41:20,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:41:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:41:20,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:41:20,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:41:20,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:41:20,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:41:20,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:41:20,772 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:41:20,773 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:41:20,866 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-10 01:41:20,868 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:41:20,874 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:41:20,874 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:41:20,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:41:20 BoogieIcfgContainer [2025-01-10 01:41:20,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:41:20,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:41:20,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:41:20,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:41:20,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:41:20" (1/3) ... [2025-01-10 01:41:20,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637713f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:41:20, skipping insertion in model container [2025-01-10 01:41:20,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:20" (2/3) ... [2025-01-10 01:41:20,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637713f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:41:20, skipping insertion in model container [2025-01-10 01:41:20,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:41:20" (3/3) ... [2025-01-10 01:41:20,883 INFO L128 eAbstractionObserver]: Analyzing ICFG array04_alloca.i [2025-01-10 01:41:20,893 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:41:20,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array04_alloca.i that has 1 procedures, 18 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-10 01:41:20,930 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:41:20,940 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=LoopHeads, 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;@7fec6999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:41:20,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:41:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:41:20,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:41:20,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:41:20,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:41:20,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:41:20,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1804968392, now seen corresponding path program 1 times [2025-01-10 01:41:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:41:20,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576457064] [2025-01-10 01:41:20,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:20,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:41:21,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:41:21,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:41:21,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:21,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:21,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:41:21,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576457064] [2025-01-10 01:41:21,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576457064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:41:21,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:41:21,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:41:21,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836400929] [2025-01-10 01:41:21,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:41:21,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:41:21,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:41:21,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:41:21,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:41:21,144 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:41:21,172 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-01-10 01:41:21,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:41:21,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:41:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:41:21,180 INFO L225 Difference]: With dead ends: 23 [2025-01-10 01:41:21,180 INFO L226 Difference]: Without dead ends: 18 [2025-01-10 01:41:21,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:41:21,186 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:41:21,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:41:21,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-10 01:41:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-10 01:41:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.5) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-01-10 01:41:21,219 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 7 [2025-01-10 01:41:21,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:41:21,220 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-01-10 01:41:21,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2025-01-10 01:41:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:41:21,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:41:21,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:41:21,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:41:21,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:41:21,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:41:21,222 INFO L85 PathProgramCache]: Analyzing trace with hash 119451378, now seen corresponding path program 1 times [2025-01-10 01:41:21,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:41:21,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178376362] [2025-01-10 01:41:21,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:21,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:41:21,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:41:21,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:41:21,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:21,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:21,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:41:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178376362] [2025-01-10 01:41:21,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178376362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:41:21,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:41:21,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:41:21,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539083504] [2025-01-10 01:41:21,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:41:21,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:41:21,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:41:21,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:41:21,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:41:21,316 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:41:21,341 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-01-10 01:41:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:41:21,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:41:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:41:21,343 INFO L225 Difference]: With dead ends: 23 [2025-01-10 01:41:21,343 INFO L226 Difference]: Without dead ends: 18 [2025-01-10 01:41:21,343 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-01-10 01:41:21,344 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:41:21,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:41:21,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-10 01:41:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-10 01:41:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-01-10 01:41:21,346 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 8 [2025-01-10 01:41:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:41:21,346 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-01-10 01:41:21,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-01-10 01:41:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:41:21,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:41:21,347 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:41:21,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:41:21,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:41:21,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:41:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1177128338, now seen corresponding path program 1 times [2025-01-10 01:41:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:41:21,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212860658] [2025-01-10 01:41:21,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:41:21,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:41:21,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:41:21,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:21,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:41:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212860658] [2025-01-10 01:41:21,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212860658] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:41:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177690607] [2025-01-10 01:41:21,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:21,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:41:21,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:41:21,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:41:21,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:41:21,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:41:21,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:41:21,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:21,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:21,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:41:21,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:41:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:21,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:41:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177690607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:41:21,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:41:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2025-01-10 01:41:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487296091] [2025-01-10 01:41:21,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:41:21,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:41:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:41:21,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:41:21,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:41:21,592 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:21,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:41:21,627 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-01-10 01:41:21,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:41:21,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:41:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:41:21,628 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:41:21,628 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 01:41:21,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:41:21,628 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:41:21,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:41:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 01:41:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2025-01-10 01:41:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-01-10 01:41:21,635 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 10 [2025-01-10 01:41:21,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:41:21,635 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-01-10 01:41:21,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-01-10 01:41:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:41:21,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:41:21,639 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:41:21,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:41:21,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:41:21,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:41:21,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:41:21,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1986474964, now seen corresponding path program 1 times [2025-01-10 01:41:21,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:41:21,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361905038] [2025-01-10 01:41:21,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:21,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:41:21,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:41:21,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:41:21,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:21,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:21,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:41:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361905038] [2025-01-10 01:41:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361905038] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:41:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990516357] [2025-01-10 01:41:21,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:21,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:41:21,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:41:21,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:41:21,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:41:21,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:41:21,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:41:21,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:21,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:21,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:41:21,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:41:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:22,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:41:22,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990516357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:41:22,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:41:22,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:41:22,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316440512] [2025-01-10 01:41:22,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:41:22,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:41:22,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:41:22,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:41:22,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:41:22,017 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:41:22,051 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-01-10 01:41:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:41:22,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:41:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:41:22,052 INFO L225 Difference]: With dead ends: 24 [2025-01-10 01:41:22,052 INFO L226 Difference]: Without dead ends: 23 [2025-01-10 01:41:22,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:41:22,053 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:41:22,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:41:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-10 01:41:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-10 01:41:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.25) internal successors, (25), 22 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-01-10 01:41:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-01-10 01:41:22,057 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2025-01-10 01:41:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:41:22,057 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-01-10 01:41:22,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-01-10 01:41:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:41:22,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:41:22,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:41:22,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:41:22,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:41:22,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:41:22,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:41:22,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2131234036, now seen corresponding path program 1 times [2025-01-10 01:41:22,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:41:22,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408961396] [2025-01-10 01:41:22,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:22,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:41:22,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:41:22,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:41:22,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:22,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:22,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:41:22,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408961396] [2025-01-10 01:41:22,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408961396] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:41:22,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938280698] [2025-01-10 01:41:22,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:22,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:41:22,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:41:22,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:41:22,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:41:22,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:41:22,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:41:22,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:22,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:22,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:41:22,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:41:22,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:41:22,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 01:41:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:22,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:41:22,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-01-10 01:41:22,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-10 01:41:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:22,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938280698] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:41:22,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:41:22,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-01-10 01:41:22,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352766725] [2025-01-10 01:41:22,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:41:22,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:41:22,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:41:22,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:41:22,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:41:22,610 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:41:22,671 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-01-10 01:41:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:41:22,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:41:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:41:22,672 INFO L225 Difference]: With dead ends: 27 [2025-01-10 01:41:22,672 INFO L226 Difference]: Without dead ends: 26 [2025-01-10 01:41:22,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:41:22,673 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:41:22,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:41:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-10 01:41:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-01-10 01:41:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-01-10 01:41:22,676 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2025-01-10 01:41:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:41:22,676 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-01-10 01:41:22,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-01-10 01:41:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:41:22,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:41:22,676 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:41:22,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:41:22,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:41:22,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:41:22,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:41:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1451181688, now seen corresponding path program 1 times [2025-01-10 01:41:22,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:41:22,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997836804] [2025-01-10 01:41:22,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:22,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:41:22,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:41:22,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:41:22,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:22,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:22,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:41:22,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997836804] [2025-01-10 01:41:22,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997836804] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:41:22,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050287655] [2025-01-10 01:41:22,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:22,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:41:22,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:41:22,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:41:22,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:41:22,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:41:22,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:41:22,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:22,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:22,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:41:22,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:41:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:23,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:41:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:23,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050287655] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:41:23,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:41:23,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:41:23,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083042759] [2025-01-10 01:41:23,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:41:23,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:41:23,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:41:23,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:41:23,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:41:23,128 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:41:23,201 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-01-10 01:41:23,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:41:23,205 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:41:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:41:23,206 INFO L225 Difference]: With dead ends: 35 [2025-01-10 01:41:23,206 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:41:23,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:41:23,206 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:41:23,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:41:23,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:41:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-10 01:41:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-01-10 01:41:23,215 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 11 [2025-01-10 01:41:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:41:23,215 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-01-10 01:41:23,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-01-10 01:41:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:41:23,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:41:23,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:41:23,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:41:23,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-10 01:41:23,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:41:23,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:41:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1643745614, now seen corresponding path program 1 times [2025-01-10 01:41:23,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:41:23,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967406089] [2025-01-10 01:41:23,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:23,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:41:23,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:41:23,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:41:23,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:23,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:23,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:41:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967406089] [2025-01-10 01:41:23,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967406089] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:41:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226276252] [2025-01-10 01:41:23,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:23,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:41:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:41:23,717 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:41:23,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:41:23,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:41:23,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:41:23,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:23,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:23,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:41:23,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:41:23,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:41:23,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:41:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:23,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:41:23,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-01-10 01:41:23,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-01-10 01:41:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:23,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226276252] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:41:23,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:41:23,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-01-10 01:41:23,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648177725] [2025-01-10 01:41:23,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:41:23,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:41:23,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:41:23,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:41:23,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:41:23,841 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:41:23,894 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-01-10 01:41:23,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:41:23,895 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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 12 [2025-01-10 01:41:23,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:41:23,895 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:41:23,895 INFO L226 Difference]: Without dead ends: 35 [2025-01-10 01:41:23,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:41:23,896 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:41:23,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 55 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:41:23,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-10 01:41:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-10 01:41:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-01-10 01:41:23,905 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 12 [2025-01-10 01:41:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:41:23,905 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-01-10 01:41:23,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-01-10 01:41:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:41:23,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:41:23,905 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:41:23,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:41:24,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:41:24,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:41:24,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:41:24,106 INFO L85 PathProgramCache]: Analyzing trace with hash 908431732, now seen corresponding path program 1 times [2025-01-10 01:41:24,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:41:24,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463516166] [2025-01-10 01:41:24,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:24,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:41:24,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:41:24,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:41:24,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:24,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:24,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:41:24,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463516166] [2025-01-10 01:41:24,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463516166] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:41:24,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453056424] [2025-01-10 01:41:24,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:24,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:41:24,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:41:24,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:41:24,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:41:24,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:41:24,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:41:24,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:24,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:24,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:41:24,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:41:24,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:41:24,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 01:41:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:41:24,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:41:24,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-01-10 01:41:24,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-01-10 01:41:24,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:41:24,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453056424] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:41:24,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:41:24,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-01-10 01:41:24,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266832204] [2025-01-10 01:41:24,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:41:24,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:41:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:41:24,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:41:24,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:41:24,575 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:41:24,639 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-01-10 01:41:24,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:41:24,640 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:41:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:41:24,640 INFO L225 Difference]: With dead ends: 43 [2025-01-10 01:41:24,640 INFO L226 Difference]: Without dead ends: 42 [2025-01-10 01:41:24,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:41:24,641 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:41:24,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:41:24,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-10 01:41:24,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-01-10 01:41:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.236842105263158) internal successors, (47), 40 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-01-10 01:41:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-01-10 01:41:24,648 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2025-01-10 01:41:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:41:24,649 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-01-10 01:41:24,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-01-10 01:41:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:41:24,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:41:24,649 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:41:24,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:41:24,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 01:41:24,854 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:41:24,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:41:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1166597170, now seen corresponding path program 1 times [2025-01-10 01:41:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:41:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679570854] [2025-01-10 01:41:24,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:41:24,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:41:24,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:41:24,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:24,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:41:25,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:41:25,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679570854] [2025-01-10 01:41:25,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679570854] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:41:25,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902896880] [2025-01-10 01:41:25,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:25,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:41:25,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:41:25,067 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:41:25,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:41:25,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:41:25,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:41:25,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:25,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:41:25,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:41:25,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:41:25,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:41:25,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 01:41:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:41:25,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:41:25,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-01-10 01:41:25,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-01-10 01:41:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:41:25,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902896880] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:41:25,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:41:25,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2025-01-10 01:41:25,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378413770] [2025-01-10 01:41:25,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:41:25,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:41:25,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:41:25,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:41:25,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:41:25,630 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:41:25,970 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2025-01-10 01:41:25,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:41:25,971 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:41:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:41:25,971 INFO L225 Difference]: With dead ends: 50 [2025-01-10 01:41:25,971 INFO L226 Difference]: Without dead ends: 28 [2025-01-10 01:41:25,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2025-01-10 01:41:25,972 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:41:25,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 43 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:41:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-10 01:41:25,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-10 01:41:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-01-10 01:41:25,975 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 14 [2025-01-10 01:41:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:41:25,976 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-01-10 01:41:25,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:41:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-01-10 01:41:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:41:25,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:41:25,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:41:25,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:41:26,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:41:26,180 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:41:26,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:41:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 511779758, now seen corresponding path program 1 times [2025-01-10 01:41:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:41:26,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655716229] [2025-01-10 01:41:26,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:41:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:41:26,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:41:26,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:41:26,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:26,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:41:26,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:41:26,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:41:26,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:41:26,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:41:26,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:41:26,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:41:26,219 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:41:26,220 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 01:41:26,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 01:41:26,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 01:41:26,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 01:41:26,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:41:26,227 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:41:26,254 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:41:26,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:41:26 BoogieIcfgContainer [2025-01-10 01:41:26,260 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:41:26,260 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:41:26,260 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:41:26,261 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:41:26,261 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:41:20" (3/4) ... [2025-01-10 01:41:26,261 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 01:41:26,313 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 8. [2025-01-10 01:41:26,375 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:41:26,379 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:41:26,379 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:41:26,379 INFO L158 Benchmark]: Toolchain (without parser) took 5986.48ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 60.1MB in the end (delta: 61.8MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2025-01-10 01:41:26,380 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 226.5MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:41:26,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.76ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 103.5MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:41:26,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.06ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 102.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:41:26,380 INFO L158 Benchmark]: Boogie Preprocessor took 20.63ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:41:26,380 INFO L158 Benchmark]: RCFGBuilder took 213.03ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 89.9MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:41:26,380 INFO L158 Benchmark]: TraceAbstraction took 5382.70ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 64.8MB in the end (delta: 24.0MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2025-01-10 01:41:26,380 INFO L158 Benchmark]: Witness Printer took 118.26ms. Allocated memory is still 167.8MB. Free memory was 64.8MB in the beginning and 60.1MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:41:26,381 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.15ms. Allocated memory is still 226.5MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.76ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 103.5MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.06ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 102.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.63ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 213.03ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 89.9MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5382.70ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 64.8MB in the end (delta: 24.0MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Witness Printer took 118.26ms. Allocated memory is still 167.8MB. Free memory was 64.8MB in the beginning and 60.1MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 375]: integer overflow possible integer overflow possible We found a FailurePath: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) VAL [length=2] [L368] int *arr = __builtin_alloca(length*sizeof(int)); VAL [arr={2:0}, length=2] [L369] COND FALSE !(!arr) [L370] i=0 VAL [arr={2:0}, i=0, length=2] [L370] COND TRUE i