./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/nla-digbench-scaling/ps5-ll_unwindbound10.c -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 1c50dd7e64abcc7a7eef6ea31e37156afb1e4322422284686cac6e6613b192c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:53:08,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:53:08,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:53:08,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:53:08,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:53:08,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:53:08,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:53:08,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:53:08,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:53:08,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:53:08,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:53:08,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:53:08,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:53:08,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:53:08,121 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:53:08,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:53:08,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:53:08,121 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:53:08,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:53:08,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:53:08,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:53:08,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:53:08,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:53:08,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:53:08,122 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 -> 1c50dd7e64abcc7a7eef6ea31e37156afb1e4322422284686cac6e6613b192c7 [2025-02-08 09:53:08,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:53:08,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:53:08,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:53:08,330 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:53:08,330 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:53:08,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound10.c [2025-02-08 09:53:09,389 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a15e1fec6/abc4ac6fd6184068b7678ab286a09a4a/FLAGa7ab90f73 [2025-02-08 09:53:09,599 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:53:09,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound10.c [2025-02-08 09:53:09,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a15e1fec6/abc4ac6fd6184068b7678ab286a09a4a/FLAGa7ab90f73 [2025-02-08 09:53:09,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a15e1fec6/abc4ac6fd6184068b7678ab286a09a4a [2025-02-08 09:53:09,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:53:09,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:53:09,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:53:09,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:53:09,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:53:09,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:53:09" (1/1) ... [2025-02-08 09:53:09,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f0a1c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:09, skipping insertion in model container [2025-02-08 09:53:09,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:53:09" (1/1) ... [2025-02-08 09:53:09,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:53:10,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:53:10,104 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:53:10,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:53:10,135 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:53:10,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10 WrapperNode [2025-02-08 09:53:10,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:53:10,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:53:10,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:53:10,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:53:10,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (1/1) ... [2025-02-08 09:53:10,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (1/1) ... [2025-02-08 09:53:10,171 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2025-02-08 09:53:10,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:53:10,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:53:10,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:53:10,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:53:10,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (1/1) ... [2025-02-08 09:53:10,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (1/1) ... [2025-02-08 09:53:10,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (1/1) ... [2025-02-08 09:53:10,194 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-02-08 09:53:10,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (1/1) ... [2025-02-08 09:53:10,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (1/1) ... [2025-02-08 09:53:10,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (1/1) ... [2025-02-08 09:53:10,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (1/1) ... [2025-02-08 09:53:10,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (1/1) ... [2025-02-08 09:53:10,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (1/1) ... [2025-02-08 09:53:10,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:53:10,203 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:53:10,203 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:53:10,203 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:53:10,203 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (1/1) ... [2025-02-08 09:53:10,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:53:10,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:53:10,230 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-02-08 09:53:10,232 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-02-08 09:53:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:53:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:53:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:53:10,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:53:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 09:53:10,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 09:53:10,288 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:53:10,289 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:53:10,627 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-02-08 09:53:10,627 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:53:10,639 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:53:10,640 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:53:10,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:53:10 BoogieIcfgContainer [2025-02-08 09:53:10,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:53:10,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:53:10,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:53:10,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:53:10,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:53:09" (1/3) ... [2025-02-08 09:53:10,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407571d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:53:10, skipping insertion in model container [2025-02-08 09:53:10,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:53:10" (2/3) ... [2025-02-08 09:53:10,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407571d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:53:10, skipping insertion in model container [2025-02-08 09:53:10,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:53:10" (3/3) ... [2025-02-08 09:53:10,649 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound10.c [2025-02-08 09:53:10,661 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:53:10,662 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll_unwindbound10.c that has 2 procedures, 188 locations, 1 initial locations, 1 loop locations, and 86 error locations. [2025-02-08 09:53:10,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:53:10,713 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;@5b3a45f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:53:10,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-02-08 09:53:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 97 states have (on average 1.9381443298969072) internal successors, (188), 183 states have internal predecessors, (188), 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-02-08 09:53:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 09:53:10,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:10,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 09:53:10,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:10,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:10,725 INFO L85 PathProgramCache]: Analyzing trace with hash 205112950, now seen corresponding path program 1 times [2025-02-08 09:53:10,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:10,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166782549] [2025-02-08 09:53:10,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:10,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 09:53:10,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 09:53:10,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:10,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:10,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:10,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166782549] [2025-02-08 09:53:10,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166782549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:53:10,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:53:10,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:53:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983492609] [2025-02-08 09:53:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:53:10,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 09:53:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:10,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 09:53:10,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 09:53:10,833 INFO L87 Difference]: Start difference. First operand has 188 states, 97 states have (on average 1.9381443298969072) internal successors, (188), 183 states have internal predecessors, (188), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:53:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:10,861 INFO L93 Difference]: Finished difference Result 361 states and 388 transitions. [2025-02-08 09:53:10,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 09:53:10,862 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 09:53:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:10,867 INFO L225 Difference]: With dead ends: 361 [2025-02-08 09:53:10,867 INFO L226 Difference]: Without dead ends: 171 [2025-02-08 09:53:10,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 09:53:10,873 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:10,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:53:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-08 09:53:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-02-08 09:53:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 95 states have (on average 1.7789473684210526) internal successors, (169), 167 states have internal predecessors, (169), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:53:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2025-02-08 09:53:10,912 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 5 [2025-02-08 09:53:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:10,912 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2025-02-08 09:53:10,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:53:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2025-02-08 09:53:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 09:53:10,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:10,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 09:53:10,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:53:10,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:10,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:10,915 INFO L85 PathProgramCache]: Analyzing trace with hash 205142741, now seen corresponding path program 1 times [2025-02-08 09:53:10,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:10,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051147306] [2025-02-08 09:53:10,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:10,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:10,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 09:53:10,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 09:53:10,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:10,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:10,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:10,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051147306] [2025-02-08 09:53:10,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051147306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:53:10,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:53:10,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:53:10,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457593216] [2025-02-08 09:53:10,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:53:10,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:53:10,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:10,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:53:10,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:53:10,999 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:53:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:11,057 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2025-02-08 09:53:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:53:11,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 09:53:11,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:11,059 INFO L225 Difference]: With dead ends: 252 [2025-02-08 09:53:11,059 INFO L226 Difference]: Without dead ends: 175 [2025-02-08 09:53:11,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:53:11,060 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 4 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:11,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 501 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:53:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-08 09:53:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-02-08 09:53:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 99 states have (on average 1.7474747474747474) internal successors, (173), 171 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:53:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2025-02-08 09:53:11,070 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 5 [2025-02-08 09:53:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:11,070 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2025-02-08 09:53:11,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:53:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2025-02-08 09:53:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 09:53:11,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:11,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:53:11,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:53:11,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:11,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:11,073 INFO L85 PathProgramCache]: Analyzing trace with hash -330920165, now seen corresponding path program 1 times [2025-02-08 09:53:11,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:11,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408019057] [2025-02-08 09:53:11,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:11,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:11,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 09:53:11,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 09:53:11,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:11,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:11,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:11,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408019057] [2025-02-08 09:53:11,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408019057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:53:11,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:53:11,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:53:11,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949910608] [2025-02-08 09:53:11,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:53:11,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:53:11,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:11,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:53:11,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:53:11,132 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:53:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:11,406 INFO L93 Difference]: Finished difference Result 311 states and 323 transitions. [2025-02-08 09:53:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:53:11,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 09:53:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:11,408 INFO L225 Difference]: With dead ends: 311 [2025-02-08 09:53:11,409 INFO L226 Difference]: Without dead ends: 255 [2025-02-08 09:53:11,409 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-02-08 09:53:11,409 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 82 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:11,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 129 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 09:53:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-08 09:53:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2025-02-08 09:53:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 172 states have (on average 1.5116279069767442) internal successors, (260), 244 states have internal predecessors, (260), 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-02-08 09:53:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 266 transitions. [2025-02-08 09:53:11,420 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 266 transitions. Word has length 8 [2025-02-08 09:53:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:11,420 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 266 transitions. [2025-02-08 09:53:11,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:53:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 266 transitions. [2025-02-08 09:53:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 09:53:11,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:11,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:53:11,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:53:11,421 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:11,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:11,421 INFO L85 PathProgramCache]: Analyzing trace with hash -6216321, now seen corresponding path program 1 times [2025-02-08 09:53:11,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:11,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904244877] [2025-02-08 09:53:11,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:11,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:11,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 09:53:11,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 09:53:11,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:11,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:11,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:11,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904244877] [2025-02-08 09:53:11,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904244877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:53:11,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:53:11,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:53:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339600189] [2025-02-08 09:53:11,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:53:11,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:53:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:11,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:53:11,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:53:11,503 INFO L87 Difference]: Start difference. First operand 249 states and 266 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:53:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:11,558 INFO L93 Difference]: Finished difference Result 268 states and 280 transitions. [2025-02-08 09:53:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:53:11,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-08 09:53:11,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:11,560 INFO L225 Difference]: With dead ends: 268 [2025-02-08 09:53:11,560 INFO L226 Difference]: Without dead ends: 263 [2025-02-08 09:53:11,560 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-02-08 09:53:11,561 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:11,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 294 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:53:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-08 09:53:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 256. [2025-02-08 09:53:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 179 states have (on average 1.4916201117318435) internal successors, (267), 251 states have internal predecessors, (267), 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-02-08 09:53:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 273 transitions. [2025-02-08 09:53:11,568 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 273 transitions. Word has length 36 [2025-02-08 09:53:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:11,568 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 273 transitions. [2025-02-08 09:53:11,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:53:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 273 transitions. [2025-02-08 09:53:11,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 09:53:11,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:11,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:53:11,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:53:11,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:11,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:11,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1678914499, now seen corresponding path program 1 times [2025-02-08 09:53:11,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:11,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236225082] [2025-02-08 09:53:11,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:11,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:11,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 09:53:11,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 09:53:11,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:11,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:11,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:11,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236225082] [2025-02-08 09:53:11,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236225082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:53:11,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:53:11,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:53:11,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445570935] [2025-02-08 09:53:11,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:53:11,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:53:11,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:11,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:53:11,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:53:11,656 INFO L87 Difference]: Start difference. First operand 256 states and 273 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:53:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:11,968 INFO L93 Difference]: Finished difference Result 267 states and 275 transitions. [2025-02-08 09:53:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:53:11,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-08 09:53:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:11,970 INFO L225 Difference]: With dead ends: 267 [2025-02-08 09:53:11,970 INFO L226 Difference]: Without dead ends: 262 [2025-02-08 09:53:11,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:53:11,971 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 84 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:11,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 252 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 09:53:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-08 09:53:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2025-02-08 09:53:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 179 states have (on average 1.4636871508379887) internal successors, (262), 251 states have internal predecessors, (262), 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-02-08 09:53:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 268 transitions. [2025-02-08 09:53:11,979 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 268 transitions. Word has length 38 [2025-02-08 09:53:11,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:11,980 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 268 transitions. [2025-02-08 09:53:11,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:53:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 268 transitions. [2025-02-08 09:53:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 09:53:11,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:11,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:53:11,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:53:11,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:11,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:11,981 INFO L85 PathProgramCache]: Analyzing trace with hash -506741837, now seen corresponding path program 1 times [2025-02-08 09:53:11,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:11,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983502760] [2025-02-08 09:53:11,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:11,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:11,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 09:53:11,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 09:53:11,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:11,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:12,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:12,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983502760] [2025-02-08 09:53:12,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983502760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:53:12,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:53:12,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:53:12,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093537485] [2025-02-08 09:53:12,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:53:12,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:53:12,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:12,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:53:12,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:53:12,065 INFO L87 Difference]: Start difference. First operand 256 states and 268 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:53:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:12,194 INFO L93 Difference]: Finished difference Result 266 states and 270 transitions. [2025-02-08 09:53:12,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:53:12,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-08 09:53:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:12,195 INFO L225 Difference]: With dead ends: 266 [2025-02-08 09:53:12,196 INFO L226 Difference]: Without dead ends: 228 [2025-02-08 09:53:12,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:53:12,197 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 128 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:12,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 244 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:53:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-08 09:53:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 222. [2025-02-08 09:53:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 145 states have (on average 1.5448275862068965) internal successors, (224), 217 states have internal predecessors, (224), 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-02-08 09:53:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 230 transitions. [2025-02-08 09:53:12,213 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 230 transitions. Word has length 39 [2025-02-08 09:53:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:12,213 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 230 transitions. [2025-02-08 09:53:12,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:53:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 230 transitions. [2025-02-08 09:53:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 09:53:12,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:12,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:53:12,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 09:53:12,216 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:12,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:12,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1678224586, now seen corresponding path program 1 times [2025-02-08 09:53:12,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:12,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435201892] [2025-02-08 09:53:12,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:12,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:12,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 09:53:12,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 09:53:12,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:12,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:12,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:12,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435201892] [2025-02-08 09:53:12,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435201892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:53:12,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:53:12,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:53:12,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692245742] [2025-02-08 09:53:12,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:53:12,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:53:12,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:12,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:53:12,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:53:12,266 INFO L87 Difference]: Start difference. First operand 222 states and 230 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-02-08 09:53:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:12,279 INFO L93 Difference]: Finished difference Result 224 states and 230 transitions. [2025-02-08 09:53:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:53:12,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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 48 [2025-02-08 09:53:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:12,281 INFO L225 Difference]: With dead ends: 224 [2025-02-08 09:53:12,281 INFO L226 Difference]: Without dead ends: 222 [2025-02-08 09:53:12,281 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-02-08 09:53:12,282 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:12,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:53:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-08 09:53:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-02-08 09:53:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 217 states have internal predecessors, (222), 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-02-08 09:53:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 228 transitions. [2025-02-08 09:53:12,290 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 228 transitions. Word has length 48 [2025-02-08 09:53:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:12,291 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 228 transitions. [2025-02-08 09:53:12,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-02-08 09:53:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 228 transitions. [2025-02-08 09:53:12,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 09:53:12,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:12,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:53:12,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 09:53:12,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:12,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash 559219979, now seen corresponding path program 1 times [2025-02-08 09:53:12,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:12,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618101226] [2025-02-08 09:53:12,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:12,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:12,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 09:53:12,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 09:53:12,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:12,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:53:12,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707295868] [2025-02-08 09:53:12,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:12,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:53:12,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:53:12,310 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-02-08 09:53:12,312 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-02-08 09:53:12,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 09:53:12,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 09:53:12,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:12,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:12,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:53:12,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:53:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:12,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:53:12,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:12,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618101226] [2025-02-08 09:53:12,431 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:53:12,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707295868] [2025-02-08 09:53:12,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707295868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:53:12,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:53:12,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:53:12,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802977212] [2025-02-08 09:53:12,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:53:12,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:53:12,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:12,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:53:12,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:53:12,432 INFO L87 Difference]: Start difference. First operand 222 states and 228 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 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-02-08 09:53:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:12,751 INFO L93 Difference]: Finished difference Result 366 states and 383 transitions. [2025-02-08 09:53:12,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:53:12,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 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 53 [2025-02-08 09:53:12,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:12,754 INFO L225 Difference]: With dead ends: 366 [2025-02-08 09:53:12,754 INFO L226 Difference]: Without dead ends: 312 [2025-02-08 09:53:12,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 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-02-08 09:53:12,754 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 96 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:12,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 153 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 09:53:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-08 09:53:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2025-02-08 09:53:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 225 states have (on average 1.4177777777777778) internal successors, (319), 297 states have internal predecessors, (319), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:53:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2025-02-08 09:53:12,764 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 53 [2025-02-08 09:53:12,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:12,764 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2025-02-08 09:53:12,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 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-02-08 09:53:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2025-02-08 09:53:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 09:53:12,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:12,765 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:53:12,771 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-02-08 09:53:12,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:53:12,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:12,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:12,966 INFO L85 PathProgramCache]: Analyzing trace with hash 982304485, now seen corresponding path program 1 times [2025-02-08 09:53:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:12,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501426771] [2025-02-08 09:53:12,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:12,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:12,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 09:53:12,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 09:53:12,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:12,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:13,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:13,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501426771] [2025-02-08 09:53:13,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501426771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:53:13,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:53:13,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:53:13,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932996790] [2025-02-08 09:53:13,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:53:13,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:53:13,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:13,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:53:13,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:53:13,052 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-02-08 09:53:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:13,122 INFO L93 Difference]: Finished difference Result 305 states and 329 transitions. [2025-02-08 09:53:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:53:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 59 [2025-02-08 09:53:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:13,123 INFO L225 Difference]: With dead ends: 305 [2025-02-08 09:53:13,123 INFO L226 Difference]: Without dead ends: 304 [2025-02-08 09:53:13,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:53:13,123 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 42 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:13,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 278 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:53:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-08 09:53:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-02-08 09:53:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 225 states have (on average 1.4133333333333333) internal successors, (318), 297 states have internal predecessors, (318), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:53:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 328 transitions. [2025-02-08 09:53:13,132 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 328 transitions. Word has length 59 [2025-02-08 09:53:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:13,132 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 328 transitions. [2025-02-08 09:53:13,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-02-08 09:53:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 328 transitions. [2025-02-08 09:53:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 09:53:13,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:13,133 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:53:13,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 09:53:13,134 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:13,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:13,134 INFO L85 PathProgramCache]: Analyzing trace with hash -898190237, now seen corresponding path program 1 times [2025-02-08 09:53:13,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:13,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754190466] [2025-02-08 09:53:13,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:13,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 09:53:13,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 09:53:13,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:13,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:13,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:13,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754190466] [2025-02-08 09:53:13,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754190466] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:53:13,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776216351] [2025-02-08 09:53:13,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:13,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:53:13,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:53:13,221 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-02-08 09:53:13,223 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-02-08 09:53:13,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 09:53:13,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 09:53:13,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:13,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:13,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:53:13,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:53:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:13,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:53:13,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776216351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:53:13,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:53:13,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-08 09:53:13,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246566807] [2025-02-08 09:53:13,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:53:13,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:53:13,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:13,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:53:13,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:53:13,367 INFO L87 Difference]: Start difference. First operand 304 states and 328 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-02-08 09:53:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:13,386 INFO L93 Difference]: Finished difference Result 304 states and 328 transitions. [2025-02-08 09:53:13,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:53:13,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 61 [2025-02-08 09:53:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:13,388 INFO L225 Difference]: With dead ends: 304 [2025-02-08 09:53:13,388 INFO L226 Difference]: Without dead ends: 303 [2025-02-08 09:53:13,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 09:53:13,388 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 120 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:13,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 331 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:53:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-08 09:53:13,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-02-08 09:53:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 225 states have (on average 1.4044444444444444) internal successors, (316), 296 states have internal predecessors, (316), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:53:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 326 transitions. [2025-02-08 09:53:13,395 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 326 transitions. Word has length 61 [2025-02-08 09:53:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:13,396 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 326 transitions. [2025-02-08 09:53:13,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-02-08 09:53:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 326 transitions. [2025-02-08 09:53:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 09:53:13,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:13,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:53:13,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 09:53:13,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:53:13,600 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:13,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:13,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2074093425, now seen corresponding path program 1 times [2025-02-08 09:53:13,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:13,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682237350] [2025-02-08 09:53:13,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:13,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 09:53:13,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 09:53:13,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:13,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:13,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:13,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682237350] [2025-02-08 09:53:13,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682237350] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:53:13,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553361786] [2025-02-08 09:53:13,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:13,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:53:13,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:53:13,688 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-02-08 09:53:13,690 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-02-08 09:53:13,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 09:53:13,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 09:53:13,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:13,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:13,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:53:13,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:53:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:13,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:53:13,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553361786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:53:13,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:53:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-08 09:53:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117024502] [2025-02-08 09:53:13,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:53:13,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:53:13,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:13,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:53:13,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:53:13,803 INFO L87 Difference]: Start difference. First operand 303 states and 326 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-02-08 09:53:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:13,838 INFO L93 Difference]: Finished difference Result 415 states and 445 transitions. [2025-02-08 09:53:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:53:13,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 62 [2025-02-08 09:53:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:13,840 INFO L225 Difference]: With dead ends: 415 [2025-02-08 09:53:13,840 INFO L226 Difference]: Without dead ends: 414 [2025-02-08 09:53:13,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:53:13,841 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 117 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:13,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 779 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:53:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-08 09:53:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 376. [2025-02-08 09:53:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 296 states have (on average 1.4189189189189189) internal successors, (420), 368 states have internal predecessors, (420), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 09:53:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 434 transitions. [2025-02-08 09:53:13,850 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 434 transitions. Word has length 62 [2025-02-08 09:53:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:13,851 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 434 transitions. [2025-02-08 09:53:13,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-02-08 09:53:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 434 transitions. [2025-02-08 09:53:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-08 09:53:13,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:13,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:53:13,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 09:53:14,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:53:14,057 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:14,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:14,057 INFO L85 PathProgramCache]: Analyzing trace with hash -757532111, now seen corresponding path program 1 times [2025-02-08 09:53:14,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:14,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291769573] [2025-02-08 09:53:14,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:14,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:14,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 09:53:14,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 09:53:14,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:14,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:53:14,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146076359] [2025-02-08 09:53:14,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:14,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:53:14,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:53:14,081 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-02-08 09:53:14,082 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-02-08 09:53:14,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 09:53:14,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 09:53:14,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:14,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:14,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:53:14,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:53:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-08 09:53:14,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:53:14,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:14,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291769573] [2025-02-08 09:53:14,237 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:53:14,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146076359] [2025-02-08 09:53:14,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146076359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:53:14,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:53:14,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:53:14,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114066491] [2025-02-08 09:53:14,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:53:14,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:53:14,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:14,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:53:14,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:53:14,238 INFO L87 Difference]: Start difference. First operand 376 states and 434 transitions. Second operand has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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-02-08 09:53:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:14,275 INFO L93 Difference]: Finished difference Result 376 states and 434 transitions. [2025-02-08 09:53:14,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:53:14,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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 92 [2025-02-08 09:53:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:14,278 INFO L225 Difference]: With dead ends: 376 [2025-02-08 09:53:14,278 INFO L226 Difference]: Without dead ends: 373 [2025-02-08 09:53:14,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:53:14,278 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 96 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:14,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 149 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:53:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-08 09:53:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-02-08 09:53:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 296 states have (on average 1.3952702702702702) internal successors, (413), 365 states have internal predecessors, (413), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 09:53:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 427 transitions. [2025-02-08 09:53:14,286 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 427 transitions. Word has length 92 [2025-02-08 09:53:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:14,286 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 427 transitions. [2025-02-08 09:53:14,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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-02-08 09:53:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 427 transitions. [2025-02-08 09:53:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 09:53:14,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:14,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:53:14,293 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-02-08 09:53:14,490 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,SelfDestructingSolverStorable11 [2025-02-08 09:53:14,490 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:14,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2008658877, now seen corresponding path program 1 times [2025-02-08 09:53:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:14,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216240984] [2025-02-08 09:53:14,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:14,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:14,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 09:53:14,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 09:53:14,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:14,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:53:14,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [988659588] [2025-02-08 09:53:14,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:14,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:53:14,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:53:14,512 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-02-08 09:53:14,513 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-02-08 09:53:14,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 09:53:14,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 09:53:14,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:14,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:14,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 09:53:14,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:53:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:14,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:53:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:14,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216240984] [2025-02-08 09:53:14,898 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:53:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988659588] [2025-02-08 09:53:14,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988659588] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:53:14,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:53:14,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-08 09:53:14,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899362184] [2025-02-08 09:53:14,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 09:53:14,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 09:53:14,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:14,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 09:53:14,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:53:14,899 INFO L87 Difference]: Start difference. First operand 373 states and 427 transitions. Second operand has 8 states, 7 states have (on average 25.285714285714285) internal successors, (177), 8 states have internal predecessors, (177), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:53:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:53:15,395 INFO L93 Difference]: Finished difference Result 502 states and 553 transitions. [2025-02-08 09:53:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 09:53:15,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 25.285714285714285) internal successors, (177), 8 states have internal predecessors, (177), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2025-02-08 09:53:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:53:15,397 INFO L225 Difference]: With dead ends: 502 [2025-02-08 09:53:15,397 INFO L226 Difference]: Without dead ends: 495 [2025-02-08 09:53:15,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:53:15,397 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 332 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 09:53:15,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 349 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 09:53:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-02-08 09:53:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 445. [2025-02-08 09:53:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 368 states have (on average 1.434782608695652) internal successors, (528), 437 states have internal predecessors, (528), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 09:53:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 542 transitions. [2025-02-08 09:53:15,408 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 542 transitions. Word has length 93 [2025-02-08 09:53:15,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:53:15,408 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 542 transitions. [2025-02-08 09:53:15,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 25.285714285714285) internal successors, (177), 8 states have internal predecessors, (177), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:53:15,409 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 542 transitions. [2025-02-08 09:53:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 09:53:15,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:53:15,409 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:53:15,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 09:53:15,609 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,SelfDestructingSolverStorable12 [2025-02-08 09:53:15,610 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:53:15,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:53:15,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2138882961, now seen corresponding path program 1 times [2025-02-08 09:53:15,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:53:15,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131425269] [2025-02-08 09:53:15,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:15,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:53:15,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 09:53:15,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 09:53:15,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:15,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:53:15,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1555623623] [2025-02-08 09:53:15,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:53:15,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:53:15,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:53:15,641 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-02-08 09:53:15,642 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-02-08 09:53:15,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 09:53:15,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 09:53:15,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:53:15,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:53:15,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 09:53:15,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:53:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:15,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:53:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:53:18,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:53:18,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131425269] [2025-02-08 09:53:18,918 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:53:18,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555623623] [2025-02-08 09:53:18,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555623623] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:53:18,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:53:18,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-02-08 09:53:18,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932316161] [2025-02-08 09:53:18,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 09:53:18,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 09:53:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:53:18,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 09:53:18,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-08 09:53:18,920 INFO L87 Difference]: Start difference. First operand 445 states and 542 transitions. Second operand has 9 states, 8 states have (on average 22.375) internal successors, (179), 9 states have internal predecessors, (179), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:53:22,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:53:27,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:53:32,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:53:35,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:53:37,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:53:42,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:53:45,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:53:49,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:53:53,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:53:55,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:00,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:03,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:05,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:07,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:10,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:15,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:19,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:24,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:26,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:29,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:32,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:36,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:39,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:44,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:46,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:49,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:52,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:54:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:54:52,081 INFO L93 Difference]: Finished difference Result 457 states and 542 transitions. [2025-02-08 09:54:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 09:54:52,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 22.375) internal successors, (179), 9 states have internal predecessors, (179), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-02-08 09:54:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:54:52,084 INFO L225 Difference]: With dead ends: 457 [2025-02-08 09:54:52,084 INFO L226 Difference]: Without dead ends: 449 [2025-02-08 09:54:52,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:54:52,084 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 282 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 44 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 93.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:54:52,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 99 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 799 Invalid, 11 Unknown, 0 Unchecked, 93.0s Time] [2025-02-08 09:54:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-02-08 09:54:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 443. [2025-02-08 09:54:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 368 states have (on average 1.3940217391304348) internal successors, (513), 435 states have internal predecessors, (513), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 09:54:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 527 transitions. [2025-02-08 09:54:52,100 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 527 transitions. Word has length 94 [2025-02-08 09:54:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:54:52,100 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 527 transitions. [2025-02-08 09:54:52,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 22.375) internal successors, (179), 9 states have internal predecessors, (179), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:54:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 527 transitions. [2025-02-08 09:54:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 09:54:52,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:54:52,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:54:52,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 09:54:52,302 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-02-08 09:54:52,302 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:54:52,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:54:52,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1983844996, now seen corresponding path program 1 times [2025-02-08 09:54:52,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:54:52,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437574563] [2025-02-08 09:54:52,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:54:52,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:54:52,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 09:54:52,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 09:54:52,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:54:52,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:54:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:54:52,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:54:52,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437574563] [2025-02-08 09:54:52,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437574563] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:54:52,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809845092] [2025-02-08 09:54:52,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:54:52,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:54:52,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:54:52,447 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-02-08 09:54:52,460 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-02-08 09:54:52,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 09:54:52,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 09:54:52,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:54:52,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:54:52,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:54:52,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:54:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:54:52,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:54:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:54:52,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809845092] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:54:52,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:54:52,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2025-02-08 09:54:52,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767911316] [2025-02-08 09:54:52,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:54:52,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 09:54:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:54:52,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 09:54:52,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-02-08 09:54:52,633 INFO L87 Difference]: Start difference. First operand 443 states and 527 transitions. Second operand has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 states have internal predecessors, (167), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 09:54:52,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:54:52,716 INFO L93 Difference]: Finished difference Result 659 states and 716 transitions. [2025-02-08 09:54:52,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 09:54:52,716 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 states have internal predecessors, (167), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2025-02-08 09:54:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:54:52,717 INFO L225 Difference]: With dead ends: 659 [2025-02-08 09:54:52,717 INFO L226 Difference]: Without dead ends: 519 [2025-02-08 09:54:52,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-02-08 09:54:52,718 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 262 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:54:52,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1027 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:54:52,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-08 09:54:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 447. [2025-02-08 09:54:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 368 states have (on average 1.4320652173913044) internal successors, (527), 435 states have internal predecessors, (527), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:54:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 543 transitions. [2025-02-08 09:54:52,730 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 543 transitions. Word has length 103 [2025-02-08 09:54:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:54:52,730 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 543 transitions. [2025-02-08 09:54:52,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 states have internal predecessors, (167), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 09:54:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 543 transitions. [2025-02-08 09:54:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 09:54:52,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:54:52,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-08 09:54:52,737 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-02-08 09:54:52,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:54:52,932 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:54:52,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:54:52,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1389581080, now seen corresponding path program 1 times [2025-02-08 09:54:52,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:54:52,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865928474] [2025-02-08 09:54:52,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:54:52,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:54:52,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 09:54:52,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 09:54:52,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:54:52,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:54:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:54:52,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:54:52,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865928474] [2025-02-08 09:54:52,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865928474] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:54:52,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644585347] [2025-02-08 09:54:52,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:54:52,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:54:52,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:54:52,993 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-02-08 09:54:52,995 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-02-08 09:54:53,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 09:54:53,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 09:54:53,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:54:53,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:54:53,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:54:53,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:54:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:54:53,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:54:53,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644585347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:54:53,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:54:53,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 09:54:53,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871892423] [2025-02-08 09:54:53,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:54:53,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:54:53,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:54:53,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:54:53,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:54:53,112 INFO L87 Difference]: Start difference. First operand 447 states and 543 transitions. Second operand has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:54:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:54:53,134 INFO L93 Difference]: Finished difference Result 480 states and 549 transitions. [2025-02-08 09:54:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:54:53,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2025-02-08 09:54:53,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:54:53,136 INFO L225 Difference]: With dead ends: 480 [2025-02-08 09:54:53,136 INFO L226 Difference]: Without dead ends: 479 [2025-02-08 09:54:53,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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-02-08 09:54:53,137 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 205 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:54:53,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 374 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:54:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-08 09:54:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 446. [2025-02-08 09:54:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 368 states have (on average 1.423913043478261) internal successors, (524), 434 states have internal predecessors, (524), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:54:53,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 540 transitions. [2025-02-08 09:54:53,148 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 540 transitions. Word has length 104 [2025-02-08 09:54:53,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:54:53,149 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 540 transitions. [2025-02-08 09:54:53,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:54:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 540 transitions. [2025-02-08 09:54:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-08 09:54:53,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:54:53,149 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-08 09:54:53,155 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-02-08 09:54:53,354 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,SelfDestructingSolverStorable15 [2025-02-08 09:54:53,354 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:54:53,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:54:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash -127340451, now seen corresponding path program 1 times [2025-02-08 09:54:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:54:53,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879050377] [2025-02-08 09:54:53,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:54:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:54:53,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 09:54:53,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 09:54:53,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:54:53,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:54:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:54:53,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:54:53,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879050377] [2025-02-08 09:54:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879050377] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:54:53,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115240160] [2025-02-08 09:54:53,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:54:53,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:54:53,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:54:53,410 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-02-08 09:54:53,411 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-02-08 09:54:53,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 09:54:53,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 09:54:53,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:54:53,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:54:53,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:54:53,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:54:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:54:53,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:54:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:54:53,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115240160] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:54:53,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:54:53,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 09:54:53,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560674958] [2025-02-08 09:54:53,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:54:53,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 09:54:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:54:53,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 09:54:53,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:54:53,619 INFO L87 Difference]: Start difference. First operand 446 states and 540 transitions. Second operand has 7 states, 6 states have (on average 38.833333333333336) internal successors, (233), 7 states have internal predecessors, (233), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:54:53,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:54:53,673 INFO L93 Difference]: Finished difference Result 545 states and 608 transitions. [2025-02-08 09:54:53,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:54:53,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 38.833333333333336) internal successors, (233), 7 states have internal predecessors, (233), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 105 [2025-02-08 09:54:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:54:53,675 INFO L225 Difference]: With dead ends: 545 [2025-02-08 09:54:53,675 INFO L226 Difference]: Without dead ends: 544 [2025-02-08 09:54:53,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:54:53,675 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 70 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:54:53,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 707 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:54:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-02-08 09:54:53,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 484. [2025-02-08 09:54:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 405 states have (on average 1.4493827160493826) internal successors, (587), 471 states have internal predecessors, (587), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 09:54:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 605 transitions. [2025-02-08 09:54:53,686 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 605 transitions. Word has length 105 [2025-02-08 09:54:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:54:53,686 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 605 transitions. [2025-02-08 09:54:53,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 38.833333333333336) internal successors, (233), 7 states have internal predecessors, (233), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:54:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 605 transitions. [2025-02-08 09:54:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-08 09:54:53,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:54:53,687 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 09:54:53,692 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-02-08 09:54:53,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:54:53,887 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:54:53,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:54:53,888 INFO L85 PathProgramCache]: Analyzing trace with hash 961198207, now seen corresponding path program 1 times [2025-02-08 09:54:53,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:54:53,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146792533] [2025-02-08 09:54:53,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:54:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:54:53,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 09:54:53,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 09:54:53,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:54:53,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:54:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 09:54:53,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:54:53,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146792533] [2025-02-08 09:54:53,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146792533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:54:53,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:54:53,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:54:53,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287434497] [2025-02-08 09:54:53,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:54:53,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:54:53,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:54:53,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:54:53,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:54:53,936 INFO L87 Difference]: Start difference. First operand 484 states and 605 transitions. Second operand has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:54:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:54:54,081 INFO L93 Difference]: Finished difference Result 484 states and 605 transitions. [2025-02-08 09:54:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:54:54,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 120 [2025-02-08 09:54:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:54:54,083 INFO L225 Difference]: With dead ends: 484 [2025-02-08 09:54:54,083 INFO L226 Difference]: Without dead ends: 477 [2025-02-08 09:54:54,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:54:54,083 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 132 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:54:54,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 32 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:54:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-02-08 09:54:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2025-02-08 09:54:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 405 states have (on average 1.4) internal successors, (567), 464 states have internal predecessors, (567), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 09:54:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 585 transitions. [2025-02-08 09:54:54,095 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 585 transitions. Word has length 120 [2025-02-08 09:54:54,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:54:54,095 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 585 transitions. [2025-02-08 09:54:54,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:54:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 585 transitions. [2025-02-08 09:54:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-08 09:54:54,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:54:54,096 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 09:54:54,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 09:54:54,096 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:54:54,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:54:54,096 INFO L85 PathProgramCache]: Analyzing trace with hash -267626515, now seen corresponding path program 1 times [2025-02-08 09:54:54,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:54:54,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248474976] [2025-02-08 09:54:54,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:54:54,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:54:54,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 09:54:54,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 09:54:54,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:54:54,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:54:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 09:54:54,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:54:54,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248474976] [2025-02-08 09:54:54,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248474976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:54:54,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:54:54,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:54:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254576287] [2025-02-08 09:54:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:54:54,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:54:54,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:54:54,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:54:54,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:54:54,148 INFO L87 Difference]: Start difference. First operand 477 states and 585 transitions. Second operand has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:54:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:54:54,304 INFO L93 Difference]: Finished difference Result 477 states and 585 transitions. [2025-02-08 09:54:54,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:54:54,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2025-02-08 09:54:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:54:54,306 INFO L225 Difference]: With dead ends: 477 [2025-02-08 09:54:54,306 INFO L226 Difference]: Without dead ends: 470 [2025-02-08 09:54:54,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:54:54,306 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 63 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:54:54,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 38 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:54:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-02-08 09:54:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-02-08 09:54:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 405 states have (on average 1.3506172839506172) internal successors, (547), 457 states have internal predecessors, (547), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 09:54:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 565 transitions. [2025-02-08 09:54:54,318 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 565 transitions. Word has length 121 [2025-02-08 09:54:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:54:54,318 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 565 transitions. [2025-02-08 09:54:54,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:54:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 565 transitions. [2025-02-08 09:54:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 09:54:54,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:54:54,319 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 09:54:54,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 09:54:54,319 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 09:54:54,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:54:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash 508961259, now seen corresponding path program 1 times [2025-02-08 09:54:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:54:54,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060543601] [2025-02-08 09:54:54,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:54:54,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:54:54,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 09:54:54,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 09:54:54,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:54:54,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:54:54,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [591821835] [2025-02-08 09:54:54,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:54:54,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:54:54,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:54:54,342 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-02-08 09:54:54,344 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-02-08 09:54:54,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 09:54:54,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 09:54:54,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:54:54,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:54:54,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 09:54:54,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:54:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:54:54,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:54:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:54:54,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:54:54,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060543601] [2025-02-08 09:54:54,648 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:54:54,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591821835] [2025-02-08 09:54:54,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591821835] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:54:54,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:54:54,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-08 09:54:54,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341211085] [2025-02-08 09:54:54,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 09:54:54,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 09:54:54,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:54:54,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 09:54:54,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:54:54,649 INFO L87 Difference]: Start difference. First operand 470 states and 565 transitions. Second operand has 8 states, 7 states have (on average 32.42857142857143) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 09:54:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:54:55,134 INFO L93 Difference]: Finished difference Result 506 states and 571 transitions. [2025-02-08 09:54:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 09:54:55,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 32.42857142857143) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 123 [2025-02-08 09:54:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:54:55,136 INFO L225 Difference]: With dead ends: 506 [2025-02-08 09:54:55,136 INFO L226 Difference]: Without dead ends: 466 [2025-02-08 09:54:55,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:54:55,137 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 488 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 09:54:55,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 168 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 09:54:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-02-08 09:54:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462. [2025-02-08 09:54:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 401 states have (on average 1.2493765586034913) internal successors, (501), 450 states have internal predecessors, (501), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 09:54:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 519 transitions. [2025-02-08 09:54:55,147 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 519 transitions. Word has length 123 [2025-02-08 09:54:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:54:55,148 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 519 transitions. [2025-02-08 09:54:55,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 32.42857142857143) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 09:54:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 519 transitions. [2025-02-08 09:54:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-08 09:54:55,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:54:55,149 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:54:55,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0