./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/LogAG.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-restricted-15/LogAG.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 68bdf78f6f996480ccfcf11b22cc3b7892db15596cae3edf06123d71c4506b1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:32:58,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:32:58,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 01:32:58,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:32:58,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:32:58,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:32:58,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:32:58,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:32:58,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:32:58,258 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:32:58,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:32:58,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:32:58,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:32:58,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:32:58,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:32:58,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:32:58,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:32:58,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:32:58,260 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68bdf78f6f996480ccfcf11b22cc3b7892db15596cae3edf06123d71c4506b1f [2025-01-10 01:32:58,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:32:58,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:32:58,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:32:58,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:32:58,471 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:32:58,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/LogAG.c [2025-01-10 01:32:59,718 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b10e2c93c/822db1467fcc4f1dab637dcd103a6be7/FLAG313455aa5 [2025-01-10 01:32:59,998 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:32:59,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/LogAG.c [2025-01-10 01:33:00,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b10e2c93c/822db1467fcc4f1dab637dcd103a6be7/FLAG313455aa5 [2025-01-10 01:33:00,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b10e2c93c/822db1467fcc4f1dab637dcd103a6be7 [2025-01-10 01:33:00,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:33:00,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:33:00,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:33:00,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:33:00,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:33:00,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@862a43c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00, skipping insertion in model container [2025-01-10 01:33:00,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:33:00,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:33:00,172 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:33:00,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:33:00,190 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:33:00,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00 WrapperNode [2025-01-10 01:33:00,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:33:00,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:33:00,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:33:00,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:33:00,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,208 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2025-01-10 01:33:00,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:33:00,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:33:00,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:33:00,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:33:00,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,220 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 01:33:00,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:33:00,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:33:00,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:33:00,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:33:00,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (1/1) ... [2025-01-10 01:33:00,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:33:00,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:00,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:33:00,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:33:00,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:33:00,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:33:00,308 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:33:00,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:33:00,365 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-10 01:33:00,366 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:33:00,371 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:33:00,371 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:33:00,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:33:00 BoogieIcfgContainer [2025-01-10 01:33:00,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:33:00,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:33:00,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:33:00,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:33:00,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:33:00" (1/3) ... [2025-01-10 01:33:00,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62163b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:33:00, skipping insertion in model container [2025-01-10 01:33:00,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:00" (2/3) ... [2025-01-10 01:33:00,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62163b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:33:00, skipping insertion in model container [2025-01-10 01:33:00,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:33:00" (3/3) ... [2025-01-10 01:33:00,377 INFO L128 eAbstractionObserver]: Analyzing ICFG LogAG.c [2025-01-10 01:33:00,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:33:00,387 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG LogAG.c that has 1 procedures, 27 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-01-10 01:33:00,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:33:00,423 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;@3ede1fea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:33:00,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 01:33:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.75) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:33:00,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:00,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:33:00,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:00,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-01-10 01:33:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80982164] [2025-01-10 01:33:00,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:00,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:00,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:33:00,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:33:00,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:00,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:00,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80982164] [2025-01-10 01:33:00,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80982164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:00,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:00,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:00,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148364126] [2025-01-10 01:33:00,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:00,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:00,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:00,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:00,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:00,533 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.75) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:00,554 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-01-10 01:33:00,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:00,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-01-10 01:33:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:00,559 INFO L225 Difference]: With dead ends: 27 [2025-01-10 01:33:00,560 INFO L226 Difference]: Without dead ends: 23 [2025-01-10 01:33:00,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:00,563 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:00,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-10 01:33:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-10 01:33:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-01-10 01:33:00,581 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 4 [2025-01-10 01:33:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:00,581 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-01-10 01:33:00,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-01-10 01:33:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:33:00,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:00,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:33:00,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:33:00,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:00,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash 28694756, now seen corresponding path program 1 times [2025-01-10 01:33:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:00,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058327644] [2025-01-10 01:33:00,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:00,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:00,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:33:00,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:33:00,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:00,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:00,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:00,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058327644] [2025-01-10 01:33:00,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058327644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:00,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:00,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:00,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907563749] [2025-01-10 01:33:00,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:00,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:00,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:00,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:00,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:00,603 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 2.5) 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-01-10 01:33:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:00,610 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-01-10 01:33:00,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:00,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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-01-10 01:33:00,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:00,611 INFO L225 Difference]: With dead ends: 23 [2025-01-10 01:33:00,611 INFO L226 Difference]: Without dead ends: 22 [2025-01-10 01:33:00,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:00,612 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:00,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-10 01:33:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-10 01:33:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-01-10 01:33:00,614 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 5 [2025-01-10 01:33:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:00,614 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-01-10 01:33:00,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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-01-10 01:33:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-01-10 01:33:00,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:33:00,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:00,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:00,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:33:00,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:00,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:00,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1805858470, now seen corresponding path program 1 times [2025-01-10 01:33:00,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:00,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948254141] [2025-01-10 01:33:00,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:00,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:00,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:33:00,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:33:00,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:00,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:00,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:00,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:00,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948254141] [2025-01-10 01:33:00,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948254141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:00,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:00,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:33:00,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280597377] [2025-01-10 01:33:00,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:00,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:33:00,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:00,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:33:00,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:33:00,649 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:00,693 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-01-10 01:33:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:33:00,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:33:00,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:00,693 INFO L225 Difference]: With dead ends: 26 [2025-01-10 01:33:00,694 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 01:33:00,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:33:00,694 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:00,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 01:33:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-01-10 01:33:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-01-10 01:33:00,699 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 7 [2025-01-10 01:33:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:00,699 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-01-10 01:33:00,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-01-10 01:33:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:33:00,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:00,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:00,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:33:00,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:00,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:00,700 INFO L85 PathProgramCache]: Analyzing trace with hash 147037780, now seen corresponding path program 1 times [2025-01-10 01:33:00,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:00,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107195942] [2025-01-10 01:33:00,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:00,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:00,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:33:00,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:33:00,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:00,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:00,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:00,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107195942] [2025-01-10 01:33:00,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107195942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:00,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:00,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122832210] [2025-01-10 01:33:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:00,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:00,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:00,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:00,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:00,743 INFO L87 Difference]: Start difference. First operand 23 states and 25 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-01-10 01:33:00,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:00,766 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-01-10 01:33:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:00,767 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-01-10 01:33:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:00,769 INFO L225 Difference]: With dead ends: 23 [2025-01-10 01:33:00,769 INFO L226 Difference]: Without dead ends: 22 [2025-01-10 01:33:00,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:00,769 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:00,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:00,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-10 01:33:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-10 01:33:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-01-10 01:33:00,775 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2025-01-10 01:33:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:00,775 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-01-10 01:33:00,775 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-01-10 01:33:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-01-10 01:33:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:33:00,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:00,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:00,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:33:00,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:00,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash 147027850, now seen corresponding path program 1 times [2025-01-10 01:33:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:00,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850256650] [2025-01-10 01:33:00,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:00,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:33:00,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:33:00,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:00,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:00,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:00,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850256650] [2025-01-10 01:33:00,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850256650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:00,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:00,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:33:00,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591246404] [2025-01-10 01:33:00,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:00,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:33:00,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:00,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:33:00,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:33:00,816 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:00,841 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2025-01-10 01:33:00,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:33:00,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:33:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:00,842 INFO L225 Difference]: With dead ends: 22 [2025-01-10 01:33:00,842 INFO L226 Difference]: Without dead ends: 21 [2025-01-10 01:33:00,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:33:00,844 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:00,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-10 01:33:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-01-10 01:33:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-01-10 01:33:00,848 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 8 [2025-01-10 01:33:00,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:00,849 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-01-10 01:33:00,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2025-01-10 01:33:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:33:00,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:00,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:00,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:33:00,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:00,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:00,851 INFO L85 PathProgramCache]: Analyzing trace with hash 263203944, now seen corresponding path program 1 times [2025-01-10 01:33:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:00,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354537284] [2025-01-10 01:33:00,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:00,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:00,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:33:00,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:33:00,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:00,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:00,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:00,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354537284] [2025-01-10 01:33:00,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354537284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:00,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:00,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:00,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171927099] [2025-01-10 01:33:00,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:00,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:00,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:00,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:00,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:00,876 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:00,881 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-01-10 01:33:00,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:00,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 01:33:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:00,882 INFO L225 Difference]: With dead ends: 21 [2025-01-10 01:33:00,882 INFO L226 Difference]: Without dead ends: 20 [2025-01-10 01:33:00,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:00,883 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:00,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-10 01:33:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-10 01:33:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-01-10 01:33:00,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2025-01-10 01:33:00,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:00,886 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-01-10 01:33:00,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-01-10 01:33:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:33:00,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:00,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:00,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:33:00,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:00,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash 262896104, now seen corresponding path program 1 times [2025-01-10 01:33:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:00,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012149185] [2025-01-10 01:33:00,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:00,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:33:00,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:33:00,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:00,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:00,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:00,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012149185] [2025-01-10 01:33:00,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012149185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:00,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:00,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:00,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238059466] [2025-01-10 01:33:00,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:00,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:00,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:00,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:00,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:00,909 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:00,919 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-01-10 01:33:00,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:00,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 01:33:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:00,920 INFO L225 Difference]: With dead ends: 23 [2025-01-10 01:33:00,921 INFO L226 Difference]: Without dead ends: 22 [2025-01-10 01:33:00,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:00,922 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:00,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-10 01:33:00,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2025-01-10 01:33:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-01-10 01:33:00,926 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2025-01-10 01:33:00,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:00,926 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-01-10 01:33:00,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:00,926 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-01-10 01:33:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:33:00,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:00,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:00,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:33:00,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:00,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash -430612266, now seen corresponding path program 1 times [2025-01-10 01:33:00,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:00,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360067731] [2025-01-10 01:33:00,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:00,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:00,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:33:00,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:33:00,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:00,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:00,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:00,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360067731] [2025-01-10 01:33:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360067731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:00,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:00,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373261933] [2025-01-10 01:33:00,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:00,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:00,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:00,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:00,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:00,991 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:01,004 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-01-10 01:33:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:01,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:33:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:01,005 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:33:01,005 INFO L226 Difference]: Without dead ends: 35 [2025-01-10 01:33:01,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:01,006 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:01,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-10 01:33:01,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-01-10 01:33:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-01-10 01:33:01,017 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 10 [2025-01-10 01:33:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:01,017 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-01-10 01:33:01,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-01-10 01:33:01,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:33:01,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:01,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:01,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:33:01,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:01,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash -440155316, now seen corresponding path program 1 times [2025-01-10 01:33:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:01,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102306915] [2025-01-10 01:33:01,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:01,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:33:01,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:33:01,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:01,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:01,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102306915] [2025-01-10 01:33:01,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102306915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:01,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:01,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:01,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417729468] [2025-01-10 01:33:01,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:01,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:01,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:01,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:01,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:01,059 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:01,076 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2025-01-10 01:33:01,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:01,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:33:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:01,077 INFO L225 Difference]: With dead ends: 52 [2025-01-10 01:33:01,077 INFO L226 Difference]: Without dead ends: 51 [2025-01-10 01:33:01,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:01,078 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:01,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 32 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:01,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-10 01:33:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2025-01-10 01:33:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.236842105263158) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-01-10 01:33:01,089 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 10 [2025-01-10 01:33:01,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:01,089 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-01-10 01:33:01,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-01-10 01:33:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:33:01,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:01,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:01,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:33:01,090 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:01,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:01,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2082461938, now seen corresponding path program 1 times [2025-01-10 01:33:01,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:01,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071920124] [2025-01-10 01:33:01,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:01,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:33:01,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:33:01,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:01,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071920124] [2025-01-10 01:33:01,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071920124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:01,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:01,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:33:01,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550320402] [2025-01-10 01:33:01,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:01,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:33:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:01,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:33:01,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:33:01,137 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:01,168 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2025-01-10 01:33:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:33:01,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 01:33:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:01,168 INFO L225 Difference]: With dead ends: 43 [2025-01-10 01:33:01,168 INFO L226 Difference]: Without dead ends: 42 [2025-01-10 01:33:01,169 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-01-10 01:33:01,169 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:01,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-10 01:33:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2025-01-10 01:33:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-01-10 01:33:01,181 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 12 [2025-01-10 01:33:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:01,181 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-01-10 01:33:01,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-01-10 01:33:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:33:01,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:01,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:01,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:33:01,182 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:01,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:01,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2125456924, now seen corresponding path program 1 times [2025-01-10 01:33:01,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:01,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292797711] [2025-01-10 01:33:01,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:01,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:33:01,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:33:01,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:01,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:01,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292797711] [2025-01-10 01:33:01,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292797711] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:01,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933693328] [2025-01-10 01:33:01,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:01,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:01,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:33:01,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:33:01,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:33:01,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:33:01,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:33:01,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:01,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933693328] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:01,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:01,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:33:01,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526210378] [2025-01-10 01:33:01,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:01,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:33:01,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:01,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:33:01,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:33:01,368 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:01,390 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2025-01-10 01:33:01,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:33:01,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 01:33:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:01,392 INFO L225 Difference]: With dead ends: 117 [2025-01-10 01:33:01,392 INFO L226 Difference]: Without dead ends: 116 [2025-01-10 01:33:01,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:33:01,393 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 56 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:01,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 66 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:01,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-10 01:33:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2025-01-10 01:33:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.196969696969697) internal successors, (79), 67 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-01-10 01:33:01,399 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 15 [2025-01-10 01:33:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:01,399 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-01-10 01:33:01,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2025-01-10 01:33:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:33:01,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:01,400 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:33:01,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:33:01,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:33:01,605 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:01,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:01,606 INFO L85 PathProgramCache]: Analyzing trace with hash 425093610, now seen corresponding path program 1 times [2025-01-10 01:33:01,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:01,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222103025] [2025-01-10 01:33:01,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:01,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:33:01,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:33:01,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:01,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:01,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222103025] [2025-01-10 01:33:01,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222103025] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123681533] [2025-01-10 01:33:01,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:01,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:01,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:01,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:33:01,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:33:01,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:33:01,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:33:01,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:01,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:01,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:33:01,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:01,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:01,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123681533] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:01,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:01,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:33:01,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380795425] [2025-01-10 01:33:01,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:01,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:33:01,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:01,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:33:01,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:33:01,766 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:01,803 INFO L93 Difference]: Finished difference Result 169 states and 196 transitions. [2025-01-10 01:33:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:33:01,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-10 01:33:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:01,804 INFO L225 Difference]: With dead ends: 169 [2025-01-10 01:33:01,804 INFO L226 Difference]: Without dead ends: 168 [2025-01-10 01:33:01,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:33:01,805 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:01,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 65 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-10 01:33:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2025-01-10 01:33:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 1.191358024691358) internal successors, (193), 163 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2025-01-10 01:33:01,823 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 18 [2025-01-10 01:33:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:01,823 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2025-01-10 01:33:01,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2025-01-10 01:33:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 01:33:01,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:01,824 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:01,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:33:02,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:02,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:02,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash 602259788, now seen corresponding path program 2 times [2025-01-10 01:33:02,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:02,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440772715] [2025-01-10 01:33:02,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:33:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:02,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 01:33:02,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:33:02,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:33:02,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:02,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:02,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440772715] [2025-01-10 01:33:02,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440772715] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:02,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054103417] [2025-01-10 01:33:02,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:33:02,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:02,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:02,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:33:02,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:33:02,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 01:33:02,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:33:02,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:33:02,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:02,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:33:02,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:02,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:02,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054103417] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:02,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:02,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 01:33:02,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729815560] [2025-01-10 01:33:02,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:02,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:33:02,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:02,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:33:02,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:33:02,284 INFO L87 Difference]: Start difference. First operand 164 states and 193 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:02,380 INFO L93 Difference]: Finished difference Result 645 states and 733 transitions. [2025-01-10 01:33:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:33:02,381 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 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 30 [2025-01-10 01:33:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:02,385 INFO L225 Difference]: With dead ends: 645 [2025-01-10 01:33:02,385 INFO L226 Difference]: Without dead ends: 644 [2025-01-10 01:33:02,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:33:02,386 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 168 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:02,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 132 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-01-10 01:33:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 314. [2025-01-10 01:33:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 312 states have (on average 1.1955128205128205) internal successors, (373), 313 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 373 transitions. [2025-01-10 01:33:02,415 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 373 transitions. Word has length 30 [2025-01-10 01:33:02,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:02,415 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 373 transitions. [2025-01-10 01:33:02,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 373 transitions. [2025-01-10 01:33:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 01:33:02,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:02,416 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1] [2025-01-10 01:33:02,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:33:02,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:02,619 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:02,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1775792858, now seen corresponding path program 2 times [2025-01-10 01:33:02,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:02,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345243536] [2025-01-10 01:33:02,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:33:02,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:02,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-10 01:33:02,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:33:02,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:33:02,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:02,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:02,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345243536] [2025-01-10 01:33:02,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345243536] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:02,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962327240] [2025-01-10 01:33:02,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:33:02,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:02,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:02,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:33:02,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:33:02,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-10 01:33:02,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:33:02,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:33:02,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:02,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:33:02,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:33:02,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:33:02,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962327240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:02,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:33:02,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2025-01-10 01:33:02,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743944330] [2025-01-10 01:33:02,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:02,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:33:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:02,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:33:02,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:33:02,765 INFO L87 Difference]: Start difference. First operand 314 states and 373 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:02,788 INFO L93 Difference]: Finished difference Result 320 states and 378 transitions. [2025-01-10 01:33:02,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:33:02,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 42 [2025-01-10 01:33:02,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:02,789 INFO L225 Difference]: With dead ends: 320 [2025-01-10 01:33:02,789 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 01:33:02,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:33:02,790 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:02,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 01:33:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-10 01:33:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2025-01-10 01:33:02,793 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 42 [2025-01-10 01:33:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:02,793 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2025-01-10 01:33:02,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2025-01-10 01:33:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 01:33:02,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:02,794 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:02,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:33:02,994 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,SelfDestructingSolverStorable13 [2025-01-10 01:33:02,995 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:02,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:02,996 INFO L85 PathProgramCache]: Analyzing trace with hash 951590476, now seen corresponding path program 3 times [2025-01-10 01:33:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:02,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478924154] [2025-01-10 01:33:02,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:33:02,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:03,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 11 equivalence classes. [2025-01-10 01:33:03,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 01:33:03,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:33:03,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:03,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:03,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478924154] [2025-01-10 01:33:03,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478924154] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:03,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725337262] [2025-01-10 01:33:03,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:33:03,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:03,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:03,175 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:33:03,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:33:03,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 11 equivalence classes. [2025-01-10 01:33:03,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 01:33:03,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:33:03,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:03,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:33:03,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:03,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:03,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725337262] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:03,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:03,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-01-10 01:33:03,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812212983] [2025-01-10 01:33:03,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:03,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:33:03,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:03,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:33:03,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:33:03,512 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:03,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:03,563 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2025-01-10 01:33:03,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:33:03,563 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 24 states have internal predecessors, (116), 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 60 [2025-01-10 01:33:03,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:03,564 INFO L225 Difference]: With dead ends: 122 [2025-01-10 01:33:03,564 INFO L226 Difference]: Without dead ends: 121 [2025-01-10 01:33:03,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:33:03,565 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:03,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:03,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-10 01:33:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-01-10 01:33:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.0083333333333333) internal successors, (121), 120 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2025-01-10 01:33:03,569 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 60 [2025-01-10 01:33:03,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:03,571 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2025-01-10 01:33:03,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2025-01-10 01:33:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-10 01:33:03,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:03,572 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:03,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:33:03,772 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,SelfDestructingSolverStorable14 [2025-01-10 01:33:03,773 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:03,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:03,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1679124404, now seen corresponding path program 4 times [2025-01-10 01:33:03,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:03,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736121471] [2025-01-10 01:33:03,774 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:33:03,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:03,782 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 120 statements into 2 equivalence classes. [2025-01-10 01:33:03,798 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-01-10 01:33:03,798 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:33:03,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:04,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:04,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736121471] [2025-01-10 01:33:04,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736121471] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:04,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208910787] [2025-01-10 01:33:04,263 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:33:04,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:04,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:04,269 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:33:04,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:33:04,296 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 120 statements into 2 equivalence classes. [2025-01-10 01:33:04,320 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-01-10 01:33:04,320 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:33:04,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:04,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 01:33:04,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:04,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208910787] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:05,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-01-10 01:33:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053862968] [2025-01-10 01:33:05,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:05,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-10 01:33:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:05,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 01:33:05,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:33:05,150 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand has 48 states, 47 states have (on average 5.0212765957446805) internal successors, (236), 48 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:05,267 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2025-01-10 01:33:05,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 01:33:05,268 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 5.0212765957446805) internal successors, (236), 48 states have internal predecessors, (236), 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 120 [2025-01-10 01:33:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:05,269 INFO L225 Difference]: With dead ends: 242 [2025-01-10 01:33:05,269 INFO L226 Difference]: Without dead ends: 241 [2025-01-10 01:33:05,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:33:05,270 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:05,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:33:05,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-10 01:33:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-01-10 01:33:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.0041666666666667) internal successors, (241), 240 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2025-01-10 01:33:05,278 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 120 [2025-01-10 01:33:05,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:05,279 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2025-01-10 01:33:05,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 5.0212765957446805) internal successors, (236), 48 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2025-01-10 01:33:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-01-10 01:33:05,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:05,281 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:05,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:33:05,482 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,SelfDestructingSolverStorable15 [2025-01-10 01:33:05,482 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:05,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:05,483 INFO L85 PathProgramCache]: Analyzing trace with hash -146371508, now seen corresponding path program 5 times [2025-01-10 01:33:05,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:05,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610621570] [2025-01-10 01:33:05,483 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:33:05,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:05,493 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 240 statements into 47 equivalence classes. [2025-01-10 01:33:05,560 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 240 of 240 statements. [2025-01-10 01:33:05,560 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:33:05,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610621570] [2025-01-10 01:33:07,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610621570] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912293268] [2025-01-10 01:33:07,091 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:33:07,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:07,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:07,095 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:33:07,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:33:07,121 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 240 statements into 47 equivalence classes. [2025-01-10 01:33:07,180 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 240 of 240 statements. [2025-01-10 01:33:07,180 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:33:07,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:07,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 01:33:07,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:07,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:09,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912293268] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:09,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:09,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 01:33:09,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411932531] [2025-01-10 01:33:09,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:09,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 01:33:09,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:09,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 01:33:09,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:33:09,907 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand has 96 states, 95 states have (on average 5.010526315789473) internal successors, (476), 96 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:10,380 INFO L93 Difference]: Finished difference Result 482 states and 529 transitions. [2025-01-10 01:33:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 01:33:10,381 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 5.010526315789473) internal successors, (476), 96 states have internal predecessors, (476), 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 240 [2025-01-10 01:33:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:10,383 INFO L225 Difference]: With dead ends: 482 [2025-01-10 01:33:10,383 INFO L226 Difference]: Without dead ends: 481 [2025-01-10 01:33:10,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:33:10,389 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:10,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:33:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-01-10 01:33:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-01-10 01:33:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.0020833333333334) internal successors, (481), 480 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 481 transitions. [2025-01-10 01:33:10,408 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 481 transitions. Word has length 240 [2025-01-10 01:33:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:10,411 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 481 transitions. [2025-01-10 01:33:10,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 5.010526315789473) internal successors, (476), 96 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 481 transitions. [2025-01-10 01:33:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-10 01:33:10,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:10,417 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:10,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:33:10,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:10,623 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:10,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:10,625 INFO L85 PathProgramCache]: Analyzing trace with hash 400192588, now seen corresponding path program 6 times [2025-01-10 01:33:10,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:10,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444296197] [2025-01-10 01:33:10,625 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:33:10,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:10,671 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 480 statements into 95 equivalence classes. [2025-01-10 01:33:10,807 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 480 of 480 statements. [2025-01-10 01:33:10,807 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:33:10,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:15,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:15,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444296197] [2025-01-10 01:33:15,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444296197] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:15,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706693227] [2025-01-10 01:33:15,864 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:33:15,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:15,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:15,866 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:33:15,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:33:15,906 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 480 statements into 95 equivalence classes. [2025-01-10 01:33:16,053 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 480 of 480 statements. [2025-01-10 01:33:16,054 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:33:16,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:16,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-10 01:33:16,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:16,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:25,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706693227] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:25,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:25,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-01-10 01:33:25,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596293198] [2025-01-10 01:33:25,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:25,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-01-10 01:33:25,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:25,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-01-10 01:33:25,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:33:25,501 INFO L87 Difference]: Start difference. First operand 481 states and 481 transitions. Second operand has 192 states, 191 states have (on average 5.005235602094241) internal successors, (956), 192 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:26,873 INFO L93 Difference]: Finished difference Result 962 states and 1057 transitions. [2025-01-10 01:33:26,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-01-10 01:33:26,873 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 5.005235602094241) internal successors, (956), 192 states have internal predecessors, (956), 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 480 [2025-01-10 01:33:26,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:26,885 INFO L225 Difference]: With dead ends: 962 [2025-01-10 01:33:26,885 INFO L226 Difference]: Without dead ends: 961 [2025-01-10 01:33:26,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 864 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:33:26,891 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:26,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 01:33:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-01-10 01:33:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2025-01-10 01:33:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 960 states have (on average 1.0010416666666666) internal successors, (961), 960 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 961 transitions. [2025-01-10 01:33:26,935 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 961 transitions. Word has length 480 [2025-01-10 01:33:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:26,939 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 961 transitions. [2025-01-10 01:33:26,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 5.005235602094241) internal successors, (956), 192 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 961 transitions. [2025-01-10 01:33:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2025-01-10 01:33:26,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:26,972 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 190, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:26,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:33:27,172 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,SelfDestructingSolverStorable17 [2025-01-10 01:33:27,173 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:33:27,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1334688692, now seen corresponding path program 7 times [2025-01-10 01:33:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:27,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069936060] [2025-01-10 01:33:27,174 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:33:27,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:27,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 960 statements into 1 equivalence classes. [2025-01-10 01:33:27,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 960 of 960 statements. [2025-01-10 01:33:27,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:27,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 90725 backedges. 0 proven. 90725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:49,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069936060] [2025-01-10 01:33:49,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069936060] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113741767] [2025-01-10 01:33:49,057 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:33:49,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:49,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:49,059 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:33:49,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:33:49,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 960 statements into 1 equivalence classes. [2025-01-10 01:33:49,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 960 of 960 statements. [2025-01-10 01:33:49,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:49,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:49,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1731 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-01-10 01:33:49,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 90725 backedges. 0 proven. 90725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:50,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:34:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 90725 backedges. 0 proven. 90725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:34:22,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113741767] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:34:22,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:34:22,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-01-10 01:34:22,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001806405] [2025-01-10 01:34:22,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:34:22,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-01-10 01:34:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:34:22,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-01-10 01:34:23,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-01-10 01:34:23,013 INFO L87 Difference]: Start difference. First operand 961 states and 961 transitions. Second operand has 384 states, 383 states have (on average 5.002610966057441) internal successors, (1916), 384 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:34:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:34:31,536 INFO L93 Difference]: Finished difference Result 1922 states and 2113 transitions. [2025-01-10 01:34:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2025-01-10 01:34:31,538 INFO L78 Accepts]: Start accepts. Automaton has has 384 states, 383 states have (on average 5.002610966057441) internal successors, (1916), 384 states have internal predecessors, (1916), 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 960 [2025-01-10 01:34:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:34:31,544 INFO L225 Difference]: With dead ends: 1922 [2025-01-10 01:34:31,544 INFO L226 Difference]: Without dead ends: 1921 [2025-01-10 01:34:31,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2110 GetRequests, 1728 SyntacticMatches, 0 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.9s TimeCoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-01-10 01:34:31,548 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 01:34:31,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1170 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 01:34:31,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2025-01-10 01:34:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1921. [2025-01-10 01:34:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1920 states have (on average 1.0005208333333333) internal successors, (1921), 1920 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:34:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 1921 transitions. [2025-01-10 01:34:31,581 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 1921 transitions. Word has length 960 [2025-01-10 01:34:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:34:31,583 INFO L471 AbstractCegarLoop]: Abstraction has 1921 states and 1921 transitions. [2025-01-10 01:34:31,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 384 states, 383 states have (on average 5.002610966057441) internal successors, (1916), 384 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:34:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 1921 transitions. [2025-01-10 01:34:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1921 [2025-01-10 01:34:31,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:34:31,599 INFO L218 NwaCegarLoop]: trace histogram [383, 383, 383, 383, 382, 1, 1, 1, 1, 1, 1] [2025-01-10 01:34:31,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:34:31,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:34:31,801 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:34:31,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:34:31,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1084103604, now seen corresponding path program 8 times [2025-01-10 01:34:31,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:34:31,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856241624] [2025-01-10 01:34:31,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:34:31,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:34:31,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1920 statements into 2 equivalence classes. [2025-01-10 01:34:32,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1920 of 1920 statements. [2025-01-10 01:34:32,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:34:32,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat