./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/nested6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/loop-invgen/nested6.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 327b0d5e70f014fe291a4771fe2bbb17cb1148e77fe8f6a261d10a47df8adacc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:43:51,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:43:51,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:43:51,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:43:51,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:43:51,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:43:51,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:43:51,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:43:51,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:43:51,405 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:43:51,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:43:51,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:43:51,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:43:51,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:43:51,405 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:43:51,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:43:51,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:43:51,405 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:43:51,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:43:51,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:43:51,406 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:43:51,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:43:51,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:43:51,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:43:51,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:43:51,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:43:51,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:43:51,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:43:51,407 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:43:51,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:43:51,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:43:51,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:43:51,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:43:51,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:43:51,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:43:51,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:43:51,407 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 327b0d5e70f014fe291a4771fe2bbb17cb1148e77fe8f6a261d10a47df8adacc [2025-01-10 01:43:51,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:43:51,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:43:51,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:43:51,661 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:43:51,661 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:43:51,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/nested6.i [2025-01-10 01:43:52,943 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d07297521/16528a596eab4bd780ead80e1ae8a5fd/FLAGa40c9b14f [2025-01-10 01:43:53,173 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:43:53,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested6.i [2025-01-10 01:43:53,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d07297521/16528a596eab4bd780ead80e1ae8a5fd/FLAGa40c9b14f [2025-01-10 01:43:53,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d07297521/16528a596eab4bd780ead80e1ae8a5fd [2025-01-10 01:43:53,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:43:53,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:43:53,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:43:53,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:43:53,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:43:53,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6741d1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53, skipping insertion in model container [2025-01-10 01:43:53,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:43:53,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:43:53,669 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:43:53,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:43:53,694 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:43:53,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53 WrapperNode [2025-01-10 01:43:53,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:43:53,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:43:53,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:43:53,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:43:53,701 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:43:53" (1/1) ... [2025-01-10 01:43:53,706 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:43:53" (1/1) ... [2025-01-10 01:43:53,716 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2025-01-10 01:43:53,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:43:53,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:43:53,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:43:53,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:43:53,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,736 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:43:53,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,738 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,740 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:43:53,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:43:53,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:43:53,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:43:53,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53" (1/1) ... [2025-01-10 01:43:53,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:43:53,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:53,772 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:43:53,781 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:43:53,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:43:53,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:43:53,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:43:53,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:43:53,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:43:53,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:43:53,833 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:43:53,835 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:43:53,925 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-10 01:43:53,925 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:43:53,931 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:43:53,931 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:43:53,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:43:53 BoogieIcfgContainer [2025-01-10 01:43:53,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:43:53,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:43:53,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:43:53,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:43:53,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:43:53" (1/3) ... [2025-01-10 01:43:53,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b934e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:43:53, skipping insertion in model container [2025-01-10 01:43:53,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:53" (2/3) ... [2025-01-10 01:43:53,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b934e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:43:53, skipping insertion in model container [2025-01-10 01:43:53,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:43:53" (3/3) ... [2025-01-10 01:43:53,941 INFO L128 eAbstractionObserver]: Analyzing ICFG nested6.i [2025-01-10 01:43:53,955 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:43:53,956 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested6.i that has 2 procedures, 45 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-01-10 01:43:54,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:43:54,014 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;@1e03cfa7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:43:54,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 01:43:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.6) internal successors, (48), 41 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:43:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:43:54,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:54,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:54,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:54,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:54,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1806845225, now seen corresponding path program 1 times [2025-01-10 01:43:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:54,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929327701] [2025-01-10 01:43:54,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:54,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:54,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:43:54,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:43:54,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:54,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:54,173 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:43:54,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:54,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929327701] [2025-01-10 01:43:54,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929327701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:54,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:54,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:43:54,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724960091] [2025-01-10 01:43:54,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:54,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:54,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:54,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:54,195 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.6) internal successors, (48), 41 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:54,266 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2025-01-10 01:43:54,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:54,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:43:54,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:54,272 INFO L225 Difference]: With dead ends: 105 [2025-01-10 01:43:54,272 INFO L226 Difference]: Without dead ends: 59 [2025-01-10 01:43:54,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:54,278 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 19 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:54,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-10 01:43:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-01-10 01:43:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 49 states have internal predecessors, (58), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:43:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2025-01-10 01:43:54,315 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 7 [2025-01-10 01:43:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:54,317 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2025-01-10 01:43:54,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2025-01-10 01:43:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:43:54,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:54,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:54,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:43:54,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:54,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1098970035, now seen corresponding path program 1 times [2025-01-10 01:43:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:54,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356577278] [2025-01-10 01:43:54,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:54,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:54,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:43:54,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:43:54,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:54,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:54,412 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:43:54,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:54,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356577278] [2025-01-10 01:43:54,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356577278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:54,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:54,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:54,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859548809] [2025-01-10 01:43:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:54,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:54,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:54,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:54,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:54,417 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:54,471 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2025-01-10 01:43:54,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:54,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:43:54,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:54,473 INFO L225 Difference]: With dead ends: 63 [2025-01-10 01:43:54,473 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 01:43:54,473 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:43:54,474 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 18 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:54,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 108 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 01:43:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2025-01-10 01:43:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.5) internal successors, (60), 51 states have internal predecessors, (60), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:43:54,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2025-01-10 01:43:54,487 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 10 [2025-01-10 01:43:54,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:54,487 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2025-01-10 01:43:54,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2025-01-10 01:43:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:43:54,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:54,488 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:54,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:43:54,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:54,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:54,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1119473712, now seen corresponding path program 1 times [2025-01-10 01:43:54,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:54,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709126150] [2025-01-10 01:43:54,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:54,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:54,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:43:54,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:43:54,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:54,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:54,563 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:43:54,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:54,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709126150] [2025-01-10 01:43:54,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709126150] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:54,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776154491] [2025-01-10 01:43:54,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:54,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:54,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:54,566 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:43:54,569 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:43:54,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:43:54,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:43:54,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:54,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:54,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:43:54,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:54,699 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:43:54,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:43:54,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776154491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:54,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:43:54,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-01-10 01:43:54,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209622751] [2025-01-10 01:43:54,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:54,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:43:54,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:54,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:43:54,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:43:54,705 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:54,836 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2025-01-10 01:43:54,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:43:54,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:43:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:54,840 INFO L225 Difference]: With dead ends: 110 [2025-01-10 01:43:54,840 INFO L226 Difference]: Without dead ends: 75 [2025-01-10 01:43:54,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:43:54,841 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 43 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:54,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 125 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-10 01:43:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. [2025-01-10 01:43:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 52 states have internal predecessors, (61), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:43:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2025-01-10 01:43:54,863 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 13 [2025-01-10 01:43:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:54,863 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2025-01-10 01:43:54,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2025-01-10 01:43:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:43:54,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:54,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:54,874 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:43:55,064 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:43:55,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:55,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1089936511, now seen corresponding path program 1 times [2025-01-10 01:43:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:55,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351663363] [2025-01-10 01:43:55,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:55,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:43:55,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:43:55,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:55,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:55,157 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:43:55,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:55,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351663363] [2025-01-10 01:43:55,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351663363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:55,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:55,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:43:55,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084542556] [2025-01-10 01:43:55,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:55,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:43:55,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:55,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:43:55,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:43:55,158 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:55,232 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2025-01-10 01:43:55,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:43:55,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:43:55,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:55,233 INFO L225 Difference]: With dead ends: 62 [2025-01-10 01:43:55,233 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 01:43:55,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:43:55,234 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 27 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:55,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 122 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 01:43:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2025-01-10 01:43:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 52 states have internal predecessors, (60), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:43:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2025-01-10 01:43:55,240 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 13 [2025-01-10 01:43:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:55,240 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-01-10 01:43:55,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2025-01-10 01:43:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:43:55,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:55,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:55,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:43:55,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:55,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash -571706442, now seen corresponding path program 1 times [2025-01-10 01:43:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:55,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660939698] [2025-01-10 01:43:55,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:55,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:43:55,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:43:55,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:55,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:55,305 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:43:55,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:55,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660939698] [2025-01-10 01:43:55,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660939698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:55,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:55,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:43:55,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851848002] [2025-01-10 01:43:55,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:55,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:43:55,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:55,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:43:55,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:43:55,306 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:55,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:55,382 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2025-01-10 01:43:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:43:55,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:43:55,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:55,383 INFO L225 Difference]: With dead ends: 77 [2025-01-10 01:43:55,383 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 01:43:55,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:43:55,383 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 36 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:55,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 153 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 01:43:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2025-01-10 01:43:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 63 states have internal predecessors, (74), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 01:43:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-01-10 01:43:55,390 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 14 [2025-01-10 01:43:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:55,390 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-01-10 01:43:55,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-01-10 01:43:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:43:55,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:55,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:55,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:43:55,391 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:55,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:55,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1498636141, now seen corresponding path program 1 times [2025-01-10 01:43:55,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:55,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805932546] [2025-01-10 01:43:55,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:55,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:55,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:43:55,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:43:55,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:55,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:43:55,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:55,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805932546] [2025-01-10 01:43:55,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805932546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:55,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:55,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:43:55,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7602525] [2025-01-10 01:43:55,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:55,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:43:55,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:55,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:43:55,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:43:55,480 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:43:55,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:55,588 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2025-01-10 01:43:55,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:43:55,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-01-10 01:43:55,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:55,590 INFO L225 Difference]: With dead ends: 107 [2025-01-10 01:43:55,590 INFO L226 Difference]: Without dead ends: 106 [2025-01-10 01:43:55,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:43:55,591 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 54 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:55,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 205 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-10 01:43:55,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 71. [2025-01-10 01:43:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 63 states have internal predecessors, (73), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 01:43:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2025-01-10 01:43:55,604 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 20 [2025-01-10 01:43:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:55,605 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2025-01-10 01:43:55,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:43:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2025-01-10 01:43:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:43:55,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:55,605 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:55,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:43:55,608 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:55,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:55,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1852390277, now seen corresponding path program 1 times [2025-01-10 01:43:55,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:55,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809264714] [2025-01-10 01:43:55,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:55,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:55,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:43:55,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:43:55,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:55,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:55,670 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:43:55,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:55,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809264714] [2025-01-10 01:43:55,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809264714] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:55,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271624842] [2025-01-10 01:43:55,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:55,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:55,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:55,675 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:43:55,681 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:43:55,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:43:55,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:43:55,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:55,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:55,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:43:55,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:43:55,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:43:55,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271624842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:55,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:43:55,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 9 [2025-01-10 01:43:55,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616872846] [2025-01-10 01:43:55,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:55,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:43:55,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:55,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:43:55,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:43:55,756 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:55,852 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2025-01-10 01:43:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:43:55,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-10 01:43:55,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:55,853 INFO L225 Difference]: With dead ends: 132 [2025-01-10 01:43:55,853 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 01:43:55,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:43:55,854 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:55,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 135 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 01:43:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2025-01-10 01:43:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 64 states have internal predecessors, (74), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 01:43:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2025-01-10 01:43:55,877 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 19 [2025-01-10 01:43:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:55,877 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2025-01-10 01:43:55,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2025-01-10 01:43:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:43:55,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:55,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:55,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:43:56,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:56,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:56,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:56,080 INFO L85 PathProgramCache]: Analyzing trace with hash 786919958, now seen corresponding path program 1 times [2025-01-10 01:43:56,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321579485] [2025-01-10 01:43:56,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:56,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:56,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:43:56,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:43:56,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:56,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:56,160 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:43:56,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:56,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321579485] [2025-01-10 01:43:56,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321579485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:56,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:56,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:43:56,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024672612] [2025-01-10 01:43:56,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:56,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:43:56,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:56,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:43:56,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:43:56,161 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:43:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:56,280 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2025-01-10 01:43:56,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:43:56,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-10 01:43:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:56,281 INFO L225 Difference]: With dead ends: 83 [2025-01-10 01:43:56,281 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 01:43:56,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:43:56,282 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:56,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 127 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 01:43:56,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2025-01-10 01:43:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 69 states have internal predecessors, (79), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 01:43:56,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2025-01-10 01:43:56,290 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 21 [2025-01-10 01:43:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:56,290 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-01-10 01:43:56,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:43:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2025-01-10 01:43:56,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:43:56,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:56,290 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:56,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:43:56,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:56,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:56,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1958431892, now seen corresponding path program 1 times [2025-01-10 01:43:56,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:56,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23899165] [2025-01-10 01:43:56,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:56,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:56,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:43:56,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:43:56,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:56,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:43:56,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:56,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23899165] [2025-01-10 01:43:56,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23899165] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:56,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313896570] [2025-01-10 01:43:56,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:56,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:56,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:56,327 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:43:56,332 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:43:56,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:43:56,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:43:56,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:56,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:56,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:43:56,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:43:56,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:43:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313896570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:56,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:43:56,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 01:43:56,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264501059] [2025-01-10 01:43:56,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:56,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:43:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:56,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:43:56,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:43:56,392 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:43:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:56,451 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2025-01-10 01:43:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:43:56,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-01-10 01:43:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:56,453 INFO L225 Difference]: With dead ends: 81 [2025-01-10 01:43:56,453 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 01:43:56,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:43:56,453 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 31 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:56,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 123 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:56,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 01:43:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2025-01-10 01:43:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 66 states have internal predecessors, (76), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 01:43:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2025-01-10 01:43:56,466 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 28 [2025-01-10 01:43:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:56,466 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2025-01-10 01:43:56,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:43:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2025-01-10 01:43:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 01:43:56,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:56,467 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:56,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:43:56,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:56,668 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:56,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:56,668 INFO L85 PathProgramCache]: Analyzing trace with hash -581846456, now seen corresponding path program 1 times [2025-01-10 01:43:56,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:56,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831705819] [2025-01-10 01:43:56,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:56,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:56,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:43:56,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:43:56,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:56,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:43:56,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:56,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831705819] [2025-01-10 01:43:56,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831705819] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:56,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936411920] [2025-01-10 01:43:56,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:56,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:56,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:56,727 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:43:56,731 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:43:56,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:43:56,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:43:56,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:56,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:56,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:43:56,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:43:56,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:43:56,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936411920] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:56,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:56,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 01:43:56,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109843702] [2025-01-10 01:43:56,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:56,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:43:56,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:56,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:43:56,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:43:56,920 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:43:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:56,980 INFO L93 Difference]: Finished difference Result 106 states and 132 transitions. [2025-01-10 01:43:56,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:43:56,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2025-01-10 01:43:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:56,981 INFO L225 Difference]: With dead ends: 106 [2025-01-10 01:43:56,981 INFO L226 Difference]: Without dead ends: 103 [2025-01-10 01:43:56,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:43:56,982 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:56,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 169 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:56,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-10 01:43:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2025-01-10 01:43:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 85 states have internal predecessors, (101), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 01:43:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2025-01-10 01:43:57,004 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 29 [2025-01-10 01:43:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:57,004 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2025-01-10 01:43:57,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:43:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2025-01-10 01:43:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 01:43:57,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:57,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:57,016 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:43:57,207 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,SelfDestructingSolverStorable9 [2025-01-10 01:43:57,207 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:57,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1497499654, now seen corresponding path program 1 times [2025-01-10 01:43:57,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:57,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580843312] [2025-01-10 01:43:57,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:57,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:57,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:43:57,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:43:57,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:57,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:43:57,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:57,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580843312] [2025-01-10 01:43:57,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580843312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:57,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:57,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:43:57,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133652033] [2025-01-10 01:43:57,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:57,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:57,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:57,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:57,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:57,258 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:43:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:57,311 INFO L93 Difference]: Finished difference Result 166 states and 224 transitions. [2025-01-10 01:43:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:57,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-01-10 01:43:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:57,313 INFO L225 Difference]: With dead ends: 166 [2025-01-10 01:43:57,313 INFO L226 Difference]: Without dead ends: 99 [2025-01-10 01:43:57,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:43:57,313 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:57,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 72 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-10 01:43:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-10 01:43:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 88 states have internal predecessors, (104), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 01:43:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2025-01-10 01:43:57,328 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 29 [2025-01-10 01:43:57,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:57,333 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2025-01-10 01:43:57,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:43:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2025-01-10 01:43:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 01:43:57,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:57,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:57,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:43:57,334 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:57,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:57,334 INFO L85 PathProgramCache]: Analyzing trace with hash -689442962, now seen corresponding path program 1 times [2025-01-10 01:43:57,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:57,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826196399] [2025-01-10 01:43:57,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:57,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:57,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:43:57,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:43:57,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:57,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:43:57,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:57,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826196399] [2025-01-10 01:43:57,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826196399] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:57,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239266111] [2025-01-10 01:43:57,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:57,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:57,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:57,446 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:43:57,448 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:43:57,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:43:57,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:43:57,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:57,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:57,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:43:57,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:43:57,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:43:57,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239266111] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:57,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:57,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-01-10 01:43:57,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320355929] [2025-01-10 01:43:57,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:57,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:43:57,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:57,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:43:57,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:43:57,595 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. Second operand has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:43:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:57,868 INFO L93 Difference]: Finished difference Result 257 states and 334 transitions. [2025-01-10 01:43:57,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:43:57,868 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2025-01-10 01:43:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:57,870 INFO L225 Difference]: With dead ends: 257 [2025-01-10 01:43:57,870 INFO L226 Difference]: Without dead ends: 256 [2025-01-10 01:43:57,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2025-01-10 01:43:57,870 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 187 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:57,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 494 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:43:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-10 01:43:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 120. [2025-01-10 01:43:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.288659793814433) internal successors, (125), 106 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 01:43:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 157 transitions. [2025-01-10 01:43:57,894 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 157 transitions. Word has length 32 [2025-01-10 01:43:57,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:57,894 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 157 transitions. [2025-01-10 01:43:57,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:43:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 157 transitions. [2025-01-10 01:43:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 01:43:57,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:57,895 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:57,901 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:43:58,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:43:58,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:58,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:58,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1837964841, now seen corresponding path program 1 times [2025-01-10 01:43:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864326668] [2025-01-10 01:43:58,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:58,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:43:58,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:43:58,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:58,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:43:58,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:58,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864326668] [2025-01-10 01:43:58,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864326668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:58,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:58,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:43:58,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009338157] [2025-01-10 01:43:58,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:58,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:43:58,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:58,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:43:58,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:43:58,171 INFO L87 Difference]: Start difference. First operand 120 states and 157 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:43:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:58,303 INFO L93 Difference]: Finished difference Result 165 states and 212 transitions. [2025-01-10 01:43:58,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:43:58,303 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-01-10 01:43:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:58,305 INFO L225 Difference]: With dead ends: 165 [2025-01-10 01:43:58,305 INFO L226 Difference]: Without dead ends: 164 [2025-01-10 01:43:58,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:43:58,305 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 61 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:58,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 230 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-10 01:43:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 120. [2025-01-10 01:43:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.2783505154639174) internal successors, (124), 106 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 01:43:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 156 transitions. [2025-01-10 01:43:58,315 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 156 transitions. Word has length 35 [2025-01-10 01:43:58,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:58,315 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 156 transitions. [2025-01-10 01:43:58,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:43:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 156 transitions. [2025-01-10 01:43:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 01:43:58,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:58,316 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:58,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:43:58,316 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:58,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1142335150, now seen corresponding path program 1 times [2025-01-10 01:43:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:58,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928448575] [2025-01-10 01:43:58,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:58,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:58,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:43:58,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:43:58,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:58,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:43:58,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:58,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928448575] [2025-01-10 01:43:58,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928448575] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:58,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627246887] [2025-01-10 01:43:58,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:58,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:58,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:58,387 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:43:58,396 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:43:58,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:43:58,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:43:58,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:58,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:58,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:43:58,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:43:58,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:43:58,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627246887] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:58,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:58,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-01-10 01:43:58,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369802126] [2025-01-10 01:43:58,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:58,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:43:58,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:58,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:43:58,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:43:58,535 INFO L87 Difference]: Start difference. First operand 120 states and 156 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-10 01:43:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:58,944 INFO L93 Difference]: Finished difference Result 280 states and 382 transitions. [2025-01-10 01:43:58,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 01:43:58,944 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 36 [2025-01-10 01:43:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:58,946 INFO L225 Difference]: With dead ends: 280 [2025-01-10 01:43:58,946 INFO L226 Difference]: Without dead ends: 278 [2025-01-10 01:43:58,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=987, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 01:43:58,947 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 218 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:58,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 470 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:43:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-10 01:43:58,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 175. [2025-01-10 01:43:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 144 states have (on average 1.2777777777777777) internal successors, (184), 154 states have internal predecessors, (184), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 01:43:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 232 transitions. [2025-01-10 01:43:58,961 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 232 transitions. Word has length 36 [2025-01-10 01:43:58,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:58,961 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 232 transitions. [2025-01-10 01:43:58,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-10 01:43:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 232 transitions. [2025-01-10 01:43:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 01:43:58,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:58,961 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:58,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:43:59,162 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,SelfDestructingSolverStorable13 [2025-01-10 01:43:59,162 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:59,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:59,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1103815608, now seen corresponding path program 1 times [2025-01-10 01:43:59,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:59,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951843363] [2025-01-10 01:43:59,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:59,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 01:43:59,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:43:59,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:59,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:43:59,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951843363] [2025-01-10 01:43:59,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951843363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:59,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:59,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:59,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295847615] [2025-01-10 01:43:59,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:59,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:59,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:59,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:59,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:59,189 INFO L87 Difference]: Start difference. First operand 175 states and 232 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:43:59,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:59,212 INFO L93 Difference]: Finished difference Result 175 states and 232 transitions. [2025-01-10 01:43:59,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:59,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-01-10 01:43:59,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:59,214 INFO L225 Difference]: With dead ends: 175 [2025-01-10 01:43:59,214 INFO L226 Difference]: Without dead ends: 174 [2025-01-10 01:43:59,215 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:43:59,215 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:59,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 68 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-10 01:43:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-01-10 01:43:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 144 states have (on average 1.2708333333333333) internal successors, (183), 153 states have internal predecessors, (183), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 01:43:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 231 transitions. [2025-01-10 01:43:59,240 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 231 transitions. Word has length 38 [2025-01-10 01:43:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:59,240 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 231 transitions. [2025-01-10 01:43:59,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:43:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 231 transitions. [2025-01-10 01:43:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-10 01:43:59,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:59,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:59,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:43:59,241 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:59,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1309194032, now seen corresponding path program 1 times [2025-01-10 01:43:59,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:59,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422264655] [2025-01-10 01:43:59,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:59,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:59,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:43:59,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:43:59,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:59,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:43:59,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:59,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422264655] [2025-01-10 01:43:59,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422264655] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:59,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006189820] [2025-01-10 01:43:59,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:59,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:59,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:59,400 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:43:59,402 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:43:59,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:43:59,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:43:59,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:59,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:59,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:43:59,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:43:59,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:43:59,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006189820] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:59,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:59,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-01-10 01:43:59,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720211009] [2025-01-10 01:43:59,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:59,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:43:59,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:59,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:43:59,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:43:59,591 INFO L87 Difference]: Start difference. First operand 174 states and 231 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 01:43:59,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:59,696 INFO L93 Difference]: Finished difference Result 250 states and 326 transitions. [2025-01-10 01:43:59,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:43:59,696 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 41 [2025-01-10 01:43:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:59,697 INFO L225 Difference]: With dead ends: 250 [2025-01-10 01:43:59,697 INFO L226 Difference]: Without dead ends: 178 [2025-01-10 01:43:59,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:43:59,698 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 58 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:59,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 256 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-10 01:43:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2025-01-10 01:43:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 153 states have internal predecessors, (182), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 01:43:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 230 transitions. [2025-01-10 01:43:59,712 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 230 transitions. Word has length 41 [2025-01-10 01:43:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:59,713 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 230 transitions. [2025-01-10 01:43:59,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 01:43:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 230 transitions. [2025-01-10 01:43:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 01:43:59,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:59,713 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:59,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:43:59,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:59,914 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:43:59,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:59,916 INFO L85 PathProgramCache]: Analyzing trace with hash 492857327, now seen corresponding path program 1 times [2025-01-10 01:43:59,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:59,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033144186] [2025-01-10 01:43:59,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:59,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:59,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 01:43:59,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:43:59,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:59,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:44:00,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:00,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033144186] [2025-01-10 01:44:00,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033144186] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:00,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535754985] [2025-01-10 01:44:00,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:00,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:00,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:00,014 INFO L229 MonitoredProcess]: Starting monitored process 9 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:44:00,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:44:00,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 01:44:00,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:44:00,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:00,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:00,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:44:00,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:44:00,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:44:00,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535754985] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:00,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:00,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-01-10 01:44:00,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290661003] [2025-01-10 01:44:00,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:00,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:44:00,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:00,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:44:00,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:44:00,160 INFO L87 Difference]: Start difference. First operand 174 states and 230 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-10 01:44:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:00,448 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2025-01-10 01:44:00,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:44:00,448 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 53 [2025-01-10 01:44:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:00,449 INFO L225 Difference]: With dead ends: 266 [2025-01-10 01:44:00,450 INFO L226 Difference]: Without dead ends: 265 [2025-01-10 01:44:00,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-01-10 01:44:00,450 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 408 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:00,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 193 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:44:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-10 01:44:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 255. [2025-01-10 01:44:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 207 states have (on average 1.289855072463768) internal successors, (267), 222 states have internal predecessors, (267), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-10 01:44:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 351 transitions. [2025-01-10 01:44:00,498 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 351 transitions. Word has length 53 [2025-01-10 01:44:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:00,498 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 351 transitions. [2025-01-10 01:44:00,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-10 01:44:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 351 transitions. [2025-01-10 01:44:00,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 01:44:00,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:00,500 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:00,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:44:00,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:44:00,701 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:44:00,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:00,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1240115308, now seen corresponding path program 2 times [2025-01-10 01:44:00,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:00,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043506935] [2025-01-10 01:44:00,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:00,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:00,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-10 01:44:00,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 56 statements. [2025-01-10 01:44:00,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:44:00,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-10 01:44:00,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:00,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043506935] [2025-01-10 01:44:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043506935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:00,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:00,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:44:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070577679] [2025-01-10 01:44:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:00,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:44:00,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:00,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:44:00,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:44:00,739 INFO L87 Difference]: Start difference. First operand 255 states and 351 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:44:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:00,850 INFO L93 Difference]: Finished difference Result 341 states and 476 transitions. [2025-01-10 01:44:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:44:00,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2025-01-10 01:44:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:00,852 INFO L225 Difference]: With dead ends: 341 [2025-01-10 01:44:00,852 INFO L226 Difference]: Without dead ends: 340 [2025-01-10 01:44:00,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:44:00,853 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 73 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:00,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 110 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-01-10 01:44:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 255. [2025-01-10 01:44:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 207 states have (on average 1.2705314009661837) internal successors, (263), 222 states have internal predecessors, (263), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-10 01:44:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 347 transitions. [2025-01-10 01:44:00,877 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 347 transitions. Word has length 56 [2025-01-10 01:44:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:00,877 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 347 transitions. [2025-01-10 01:44:00,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:44:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 347 transitions. [2025-01-10 01:44:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 01:44:00,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:00,878 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:00,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:44:00,878 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:44:00,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:00,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1432128758, now seen corresponding path program 2 times [2025-01-10 01:44:00,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:00,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098649994] [2025-01-10 01:44:00,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:00,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:00,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-10 01:44:00,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 56 statements. [2025-01-10 01:44:00,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:44:00,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-10 01:44:00,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:00,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098649994] [2025-01-10 01:44:00,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098649994] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:00,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350235248] [2025-01-10 01:44:00,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:00,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:00,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:00,899 INFO L229 MonitoredProcess]: Starting monitored process 10 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:44:00,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:44:00,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-10 01:44:00,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 56 statements. [2025-01-10 01:44:00,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:44:00,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:00,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:44:00,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-10 01:44:00,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-10 01:44:01,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350235248] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:01,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:01,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:44:01,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318811449] [2025-01-10 01:44:01,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:01,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:44:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:01,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:44:01,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:44:01,023 INFO L87 Difference]: Start difference. First operand 255 states and 347 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:44:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:01,065 INFO L93 Difference]: Finished difference Result 255 states and 347 transitions. [2025-01-10 01:44:01,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:44:01,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2025-01-10 01:44:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:01,067 INFO L225 Difference]: With dead ends: 255 [2025-01-10 01:44:01,067 INFO L226 Difference]: Without dead ends: 254 [2025-01-10 01:44:01,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:44:01,068 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:01,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-10 01:44:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 208. [2025-01-10 01:44:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 168 states have (on average 1.255952380952381) internal successors, (211), 180 states have internal predecessors, (211), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-10 01:44:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 281 transitions. [2025-01-10 01:44:01,111 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 281 transitions. Word has length 56 [2025-01-10 01:44:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:01,111 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 281 transitions. [2025-01-10 01:44:01,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:44:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 281 transitions. [2025-01-10 01:44:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 01:44:01,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:01,112 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:01,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:44:01,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:01,312 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:44:01,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1912849215, now seen corresponding path program 1 times [2025-01-10 01:44:01,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:01,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111240128] [2025-01-10 01:44:01,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:01,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:01,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 01:44:01,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 01:44:01,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:01,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-10 01:44:01,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:01,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111240128] [2025-01-10 01:44:01,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111240128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:01,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:01,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:44:01,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982238367] [2025-01-10 01:44:01,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:01,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:44:01,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:01,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:44:01,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:44:01,383 INFO L87 Difference]: Start difference. First operand 208 states and 281 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:44:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:01,453 INFO L93 Difference]: Finished difference Result 208 states and 281 transitions. [2025-01-10 01:44:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:44:01,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2025-01-10 01:44:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:01,455 INFO L225 Difference]: With dead ends: 208 [2025-01-10 01:44:01,455 INFO L226 Difference]: Without dead ends: 207 [2025-01-10 01:44:01,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:44:01,455 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:01,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:01,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-01-10 01:44:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-01-10 01:44:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 168 states have (on average 1.244047619047619) internal successors, (209), 179 states have internal predecessors, (209), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-10 01:44:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 279 transitions. [2025-01-10 01:44:01,495 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 279 transitions. Word has length 58 [2025-01-10 01:44:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:01,495 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 279 transitions. [2025-01-10 01:44:01,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:44:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 279 transitions. [2025-01-10 01:44:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 01:44:01,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:01,496 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:01,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:44:01,496 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:44:01,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:01,496 INFO L85 PathProgramCache]: Analyzing trace with hash 484621650, now seen corresponding path program 1 times [2025-01-10 01:44:01,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:01,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643112574] [2025-01-10 01:44:01,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:01,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:01,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 01:44:01,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 01:44:01,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:01,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:44:01,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:01,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643112574] [2025-01-10 01:44:01,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643112574] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:01,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722613619] [2025-01-10 01:44:01,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:01,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:01,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:01,675 INFO L229 MonitoredProcess]: Starting monitored process 11 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:44:01,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:44:01,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 01:44:01,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 01:44:01,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:01,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:01,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:44:01,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:44:01,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:44:02,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722613619] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:02,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:02,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2025-01-10 01:44:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423496081] [2025-01-10 01:44:02,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:02,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-10 01:44:02,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:02,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-10 01:44:02,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2025-01-10 01:44:02,006 INFO L87 Difference]: Start difference. First operand 207 states and 279 transitions. Second operand has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 12 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2025-01-10 01:44:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:02,904 INFO L93 Difference]: Finished difference Result 599 states and 844 transitions. [2025-01-10 01:44:02,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-10 01:44:02,905 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 12 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) Word has length 58 [2025-01-10 01:44:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:02,908 INFO L225 Difference]: With dead ends: 599 [2025-01-10 01:44:02,908 INFO L226 Difference]: Without dead ends: 598 [2025-01-10 01:44:02,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1059, Invalid=4947, Unknown=0, NotChecked=0, Total=6006 [2025-01-10 01:44:02,910 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 622 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:02,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 442 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:44:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-01-10 01:44:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 263. [2025-01-10 01:44:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 227 states have internal predecessors, (265), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-10 01:44:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 351 transitions. [2025-01-10 01:44:02,942 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 351 transitions. Word has length 58 [2025-01-10 01:44:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:02,942 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 351 transitions. [2025-01-10 01:44:02,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 12 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2025-01-10 01:44:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 351 transitions. [2025-01-10 01:44:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 01:44:02,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:02,943 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:02,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:44:03,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:03,144 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:44:03,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1924081874, now seen corresponding path program 2 times [2025-01-10 01:44:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:03,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087767276] [2025-01-10 01:44:03,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:03,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-01-10 01:44:03,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 66 statements. [2025-01-10 01:44:03,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:44:03,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-10 01:44:03,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:03,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087767276] [2025-01-10 01:44:03,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087767276] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:03,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041475782] [2025-01-10 01:44:03,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:03,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:03,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:03,181 INFO L229 MonitoredProcess]: Starting monitored process 12 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:44:03,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:44:03,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-01-10 01:44:03,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 66 statements. [2025-01-10 01:44:03,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:44:03,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:03,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:44:03,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-10 01:44:03,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-10 01:44:03,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041475782] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:03,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:03,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2025-01-10 01:44:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821078452] [2025-01-10 01:44:03,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:03,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:44:03,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:03,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:44:03,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:44:03,332 INFO L87 Difference]: Start difference. First operand 263 states and 351 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-10 01:44:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:03,440 INFO L93 Difference]: Finished difference Result 263 states and 351 transitions. [2025-01-10 01:44:03,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:44:03,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 66 [2025-01-10 01:44:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:03,444 INFO L225 Difference]: With dead ends: 263 [2025-01-10 01:44:03,444 INFO L226 Difference]: Without dead ends: 262 [2025-01-10 01:44:03,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:44:03,445 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:03,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-10 01:44:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 154. [2025-01-10 01:44:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 124 states have (on average 1.2258064516129032) internal successors, (152), 134 states have internal predecessors, (152), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-10 01:44:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 206 transitions. [2025-01-10 01:44:03,466 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 206 transitions. Word has length 66 [2025-01-10 01:44:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:03,466 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 206 transitions. [2025-01-10 01:44:03,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-10 01:44:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 206 transitions. [2025-01-10 01:44:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 01:44:03,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:03,470 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:03,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:44:03,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-10 01:44:03,671 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:44:03,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2099973342, now seen corresponding path program 3 times [2025-01-10 01:44:03,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:03,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300264557] [2025-01-10 01:44:03,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:44:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:03,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 5 equivalence classes. [2025-01-10 01:44:03,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 71 statements. [2025-01-10 01:44:03,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:44:03,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-10 01:44:03,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:03,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300264557] [2025-01-10 01:44:03,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300264557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:03,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:03,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:44:03,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840086823] [2025-01-10 01:44:03,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:03,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:44:03,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:03,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:44:03,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:44:03,724 INFO L87 Difference]: Start difference. First operand 154 states and 206 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:44:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:03,809 INFO L93 Difference]: Finished difference Result 181 states and 242 transitions. [2025-01-10 01:44:03,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:44:03,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2025-01-10 01:44:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:03,811 INFO L225 Difference]: With dead ends: 181 [2025-01-10 01:44:03,811 INFO L226 Difference]: Without dead ends: 180 [2025-01-10 01:44:03,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:44:03,811 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:03,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 84 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-10 01:44:03,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 123. [2025-01-10 01:44:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 100 states have (on average 1.2) internal successors, (120), 107 states have internal predecessors, (120), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-10 01:44:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 162 transitions. [2025-01-10 01:44:03,830 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 162 transitions. Word has length 71 [2025-01-10 01:44:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:03,830 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 162 transitions. [2025-01-10 01:44:03,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:44:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 162 transitions. [2025-01-10 01:44:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 01:44:03,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:03,831 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:03,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:44:03,831 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:44:03,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:03,832 INFO L85 PathProgramCache]: Analyzing trace with hash 14521156, now seen corresponding path program 1 times [2025-01-10 01:44:03,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:03,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207053700] [2025-01-10 01:44:03,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:03,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 01:44:03,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 01:44:03,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:03,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 19 proven. 30 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-10 01:44:03,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:03,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207053700] [2025-01-10 01:44:03,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207053700] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:03,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039190491] [2025-01-10 01:44:03,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:03,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:03,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:03,982 INFO L229 MonitoredProcess]: Starting monitored process 13 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:44:03,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:44:04,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 01:44:04,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 01:44:04,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:04,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:04,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:44:04,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 95 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-10 01:44:04,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 31 proven. 12 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-10 01:44:04,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039190491] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:04,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:04,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 20 [2025-01-10 01:44:04,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527240874] [2025-01-10 01:44:04,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:04,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:44:04,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:04,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:44:04,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:44:04,254 INFO L87 Difference]: Start difference. First operand 123 states and 162 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-10 01:44:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:04,445 INFO L93 Difference]: Finished difference Result 230 states and 306 transitions. [2025-01-10 01:44:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:44:04,446 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 74 [2025-01-10 01:44:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:04,447 INFO L225 Difference]: With dead ends: 230 [2025-01-10 01:44:04,447 INFO L226 Difference]: Without dead ends: 182 [2025-01-10 01:44:04,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:44:04,448 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 92 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:04,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 237 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-10 01:44:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 154. [2025-01-10 01:44:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 125 states have (on average 1.192) internal successors, (149), 134 states have internal predecessors, (149), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-10 01:44:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 203 transitions. [2025-01-10 01:44:04,472 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 203 transitions. Word has length 74 [2025-01-10 01:44:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:04,472 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 203 transitions. [2025-01-10 01:44:04,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 6 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-10 01:44:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 203 transitions. [2025-01-10 01:44:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-10 01:44:04,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:04,474 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:04,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:44:04,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:04,679 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:44:04,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:04,679 INFO L85 PathProgramCache]: Analyzing trace with hash 3127688, now seen corresponding path program 2 times [2025-01-10 01:44:04,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:04,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285445499] [2025-01-10 01:44:04,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:04,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:04,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-01-10 01:44:04,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 89 statements. [2025-01-10 01:44:04,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:44:04,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-01-10 01:44:04,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:04,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285445499] [2025-01-10 01:44:04,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285445499] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117114726] [2025-01-10 01:44:04,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:04,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:04,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:04,706 INFO L229 MonitoredProcess]: Starting monitored process 14 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:44:04,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:44:04,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-01-10 01:44:04,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 89 statements. [2025-01-10 01:44:04,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:44:04,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:04,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:44:04,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-01-10 01:44:04,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:04,874 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-01-10 01:44:04,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117114726] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:04,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:04,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 01:44:04,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297204602] [2025-01-10 01:44:04,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:04,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:44:04,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:04,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:44:04,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:44:04,876 INFO L87 Difference]: Start difference. First operand 154 states and 203 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 01:44:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:04,930 INFO L93 Difference]: Finished difference Result 154 states and 203 transitions. [2025-01-10 01:44:04,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:44:04,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 89 [2025-01-10 01:44:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:04,931 INFO L225 Difference]: With dead ends: 154 [2025-01-10 01:44:04,931 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:44:04,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:44:04,932 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:04,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 100 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:44:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:44:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:44:04,932 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2025-01-10 01:44:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:04,932 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:44:04,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 01:44:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:44:04,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:44:04,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-01-10 01:44:04,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-01-10 01:44:04,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 01:44:04,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 01:44:04,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 01:44:04,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 01:44:04,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 01:44:04,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 01:44:04,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 01:44:04,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-01-10 01:44:04,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:44:05,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:05,140 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:05,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:44:14,033 WARN L286 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 217 DAG size of output: 131 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-10 01:44:20,374 WARN L286 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 217 DAG size of output: 131 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-10 01:44:21,503 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:44:21,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:44:21 BoogieIcfgContainer [2025-01-10 01:44:21,514 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:44:21,514 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:44:21,514 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:44:21,515 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:44:21,515 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:43:53" (3/4) ... [2025-01-10 01:44:21,524 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:44:21,532 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:44:21,534 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-10 01:44:21,534 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:44:21,534 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:44:21,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:44:21,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:44:21,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:44:21,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:44:21,608 INFO L158 Benchmark]: Toolchain (without parser) took 28072.76ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 112.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 983.3MB. Max. memory is 16.1GB. [2025-01-10 01:44:21,608 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:44:21,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.51ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:44:21,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.56ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 967.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:44:21,608 INFO L158 Benchmark]: Boogie Preprocessor took 29.17ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:44:21,609 INFO L158 Benchmark]: RCFGBuilder took 184.17ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 87.9MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:44:21,609 INFO L158 Benchmark]: TraceAbstraction took 27580.55ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 87.0MB in the beginning and 641.6MB in the end (delta: -554.6MB). Peak memory consumption was 962.3MB. Max. memory is 16.1GB. [2025-01-10 01:44:21,609 INFO L158 Benchmark]: Witness Printer took 92.86ms. Allocated memory is still 1.7GB. Free memory was 641.6MB in the beginning and 1.6GB in the end (delta: -973.0MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2025-01-10 01:44:21,610 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.13ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.51ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.56ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 967.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.17ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 184.17ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 87.9MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 27580.55ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 87.0MB in the beginning and 641.6MB in the end (delta: -554.6MB). Peak memory consumption was 962.3MB. Max. memory is 16.1GB. * Witness Printer took 92.86ms. Allocated memory is still 1.7GB. Free memory was 641.6MB in the beginning and 1.6GB in the end (delta: -973.0MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 25, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2418 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2292 mSDsluCounter, 4341 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3497 mSDsCounter, 369 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3001 IncrementalHoareTripleChecker+Invalid, 3370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 369 mSolverCounterUnsat, 844 mSDtfsCounter, 3001 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1372 GetRequests, 1037 SyntacticMatches, 14 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2885 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=21, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 1046 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1560 NumberOfCodeBlocks, 1145 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2046 ConstructedInterpolants, 0 QuantifiedInterpolants, 4764 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1000 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 48 InterpolantComputations, 15 PerfectInterpolantSequences, 2369/2702 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((i <= 999998) && (0 <= (j + 2147483648))) && (0 <= (k + 2147483648))) && (1 <= i)) && (n <= 999999)) && (k <= 2147483646)) && (j <= 2147483646)) || (((((((0 <= (k + 2147483648)) && (i == 0)) && (1 <= j)) && (n <= 999999)) && (1 <= n)) && (k <= 2147483646)) && (j <= 2147483646))) || ((((((0 <= (k + 2147483648)) && (i == 0)) && (n <= 999999)) && (1 <= n)) && (k <= 2147483646)) && (j == 0))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((0 <= k) && (i == 0)) && (n <= 999999)) && (1 <= n)) && (k <= 2147483646)) && (j == 0)) || ((((((i == 0) && (1 <= j)) && (n <= 999999)) && (((long long) j + 1) <= n)) && (k <= 2147483646)) && (1 <= k))) || ((((((i <= 999998) && (0 <= (j + 2147483648))) && (1 <= i)) && (n <= 999999)) && (((long long) j + 1) <= n)) && (k <= 2147483646))) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((0 <= (k + 2147483648)) && (i == 0)) && (n <= 999999)) && (k <= 2147483646)) || ((((0 <= (k + 2147483648)) && (1 <= i)) && (n <= 999999)) && (k <= 2147483646))) || ((i == 1) && (n <= 1))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:44:21,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE