./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.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/McCarthyIterative.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 faa806fd1be90697a522dfc0988145f6572d5d87fac98caf7aa5fe5b66e6095c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:33:02,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:33:02,378 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:33:02,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:33:02,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:33:02,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:33:02,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:33:02,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:33:02,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:33:02,401 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:33:02,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:33:02,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:33:02,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:33:02,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:33:02,401 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:33:02,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:33:02,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:33:02,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:33:02,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:33:02,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:33:02,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:33:02,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:33:02,402 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:33:02,402 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:33:02,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:33:02,402 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:33:02,402 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:33:02,403 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:33:02,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:33:02,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:33:02,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:33:02,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:33:02,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:33:02,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:33:02,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:33:02,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:33:02,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:33:02,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:33:02,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:33:02,404 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:33:02,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:33:02,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:33:02,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:33:02,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:33:02,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:33:02,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:33:02,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:33:02,404 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 -> faa806fd1be90697a522dfc0988145f6572d5d87fac98caf7aa5fe5b66e6095c [2025-01-10 01:33:02,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:33:02,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:33:02,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:33:02,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:33:02,589 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:33:02,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2025-01-10 01:33:03,826 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ba651a1e/5a1779786a4048b094a4811a29c7f79d/FLAGfd06dd5e6 [2025-01-10 01:33:04,084 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:33:04,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2025-01-10 01:33:04,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ba651a1e/5a1779786a4048b094a4811a29c7f79d/FLAGfd06dd5e6 [2025-01-10 01:33:04,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ba651a1e/5a1779786a4048b094a4811a29c7f79d [2025-01-10 01:33:04,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:33:04,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:33:04,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:33:04,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:33:04,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:33:04,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:33:04" (1/1) ... [2025-01-10 01:33:04,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d16481e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:04, skipping insertion in model container [2025-01-10 01:33:04,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:33:04" (1/1) ... [2025-01-10 01:33:04,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:33:04,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:33:04,240 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:33:04,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:33:04,274 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:33:04,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:04 WrapperNode [2025-01-10 01:33:04,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:33:04,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:33:04,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:33:04,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:33:04,286 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:04" (1/1) ... [2025-01-10 01:33:04,288 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:04" (1/1) ... [2025-01-10 01:33:04,302 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2025-01-10 01:33:04,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:33:04,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:33:04,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:33:04,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:33:04,308 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:04" (1/1) ... [2025-01-10 01:33:04,308 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:04" (1/1) ... [2025-01-10 01:33:04,312 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:04" (1/1) ... [2025-01-10 01:33:04,319 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 01:33:04,320 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:04" (1/1) ... [2025-01-10 01:33:04,320 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:04" (1/1) ... [2025-01-10 01:33:04,321 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:04" (1/1) ... [2025-01-10 01:33:04,321 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:04" (1/1) ... [2025-01-10 01:33:04,323 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:04" (1/1) ... [2025-01-10 01:33:04,324 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:04" (1/1) ... [2025-01-10 01:33:04,325 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:04" (1/1) ... [2025-01-10 01:33:04,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:33:04,328 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:33:04,328 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:33:04,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:33:04,329 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:04" (1/1) ... [2025-01-10 01:33:04,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:33:04,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:04,351 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:04,357 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:04,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:33:04,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:33:04,413 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:33:04,415 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:33:04,461 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-10 01:33:04,462 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:33:04,467 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:33:04,468 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:33:04,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:33:04 BoogieIcfgContainer [2025-01-10 01:33:04,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:33:04,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:33:04,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:33:04,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:33:04,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:33:04" (1/3) ... [2025-01-10 01:33:04,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c923088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:33:04, skipping insertion in model container [2025-01-10 01:33:04,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:33:04" (2/3) ... [2025-01-10 01:33:04,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c923088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:33:04, skipping insertion in model container [2025-01-10 01:33:04,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:33:04" (3/3) ... [2025-01-10 01:33:04,475 INFO L128 eAbstractionObserver]: Analyzing ICFG McCarthyIterative.c [2025-01-10 01:33:04,485 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:33:04,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG McCarthyIterative.c that has 1 procedures, 23 locations, 1 initial locations, 1 loop locations, and 8 error locations. [2025-01-10 01:33:04,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:33:04,533 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;@3a58294a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:33:04,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 01:33:04,536 INFO L276 IsEmpty]: Start isEmpty. 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:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:33:04,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:04,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:33:04,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:04,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:04,547 INFO L85 PathProgramCache]: Analyzing trace with hash 28695108, now seen corresponding path program 1 times [2025-01-10 01:33:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:04,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462572698] [2025-01-10 01:33:04,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:04,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:04,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:33:04,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:33:04,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:04,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:04,681 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:04,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:04,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462572698] [2025-01-10 01:33:04,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462572698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:04,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:04,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:04,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144190849] [2025-01-10 01:33:04,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:04,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:04,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:04,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:04,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:04,704 INFO L87 Difference]: Start difference. First 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) 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:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:04,746 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-01-10 01:33:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:04,748 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:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:04,752 INFO L225 Difference]: With dead ends: 33 [2025-01-10 01:33:04,752 INFO L226 Difference]: Without dead ends: 28 [2025-01-10 01:33:04,754 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:04,756 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:04,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 27 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-10 01:33:04,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-01-10 01:33:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-01-10 01:33:04,779 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 5 [2025-01-10 01:33:04,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:04,779 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-01-10 01:33:04,779 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:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-01-10 01:33:04,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:33:04,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:04,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:33:04,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:33:04,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:04,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:04,780 INFO L85 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2025-01-10 01:33:04,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:04,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207032653] [2025-01-10 01:33:04,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:04,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:04,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:33:04,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:33:04,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:04,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:04,814 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:04,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:04,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207032653] [2025-01-10 01:33:04,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207032653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:04,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:04,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:04,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835967987] [2025-01-10 01:33:04,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:04,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:04,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:04,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:04,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:04,816 INFO L87 Difference]: Start difference. First operand 26 states and 31 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:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:04,838 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2025-01-10 01:33:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:04,838 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:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:04,838 INFO L225 Difference]: With dead ends: 26 [2025-01-10 01:33:04,838 INFO L226 Difference]: Without dead ends: 25 [2025-01-10 01:33:04,839 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:04,839 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 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:04,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 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:04,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-10 01:33:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-10 01:33:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 24 states have internal predecessors, (30), 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:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-01-10 01:33:04,846 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 5 [2025-01-10 01:33:04,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:04,846 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-01-10 01:33:04,847 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:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-01-10 01:33:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:33:04,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:04,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:33:04,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:33:04,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:04,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:04,849 INFO L85 PathProgramCache]: Analyzing trace with hash 889548401, now seen corresponding path program 1 times [2025-01-10 01:33:04,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:04,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392420427] [2025-01-10 01:33:04,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:04,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:04,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:33:04,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:33:04,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:04,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:04,880 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:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:04,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392420427] [2025-01-10 01:33:04,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392420427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:04,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:04,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:04,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149596652] [2025-01-10 01:33:04,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:04,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:04,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:04,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:04,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:04,883 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:04,905 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-01-10 01:33:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:04,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:33:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:04,906 INFO L225 Difference]: With dead ends: 25 [2025-01-10 01:33:04,906 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 01:33:04,906 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:04,907 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:04,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 01:33:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-10 01:33:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 23 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:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-01-10 01:33:04,910 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 6 [2025-01-10 01:33:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:04,910 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-01-10 01:33:04,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-01-10 01:33:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:33:04,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:04,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:33:04,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:33:04,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:04,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:04,911 INFO L85 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2025-01-10 01:33:04,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:04,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565350103] [2025-01-10 01:33:04,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:04,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:04,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:33:04,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:33:04,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:04,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:04,928 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:04,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:04,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565350103] [2025-01-10 01:33:04,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565350103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:04,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:04,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:04,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774456020] [2025-01-10 01:33:04,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:04,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:04,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:04,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:04,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:04,929 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:04,939 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-01-10 01:33:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:04,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:33:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:04,940 INFO L225 Difference]: With dead ends: 24 [2025-01-10 01:33:04,940 INFO L226 Difference]: Without dead ends: 23 [2025-01-10 01:33:04,940 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:04,941 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:04,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-10 01:33:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-10 01:33:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-01-10 01:33:04,943 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 6 [2025-01-10 01:33:04,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:04,943 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-01-10 01:33:04,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-01-10 01:33:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:33:04,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:04,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:04,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:33:04,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:04,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:04,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1806196710, now seen corresponding path program 1 times [2025-01-10 01:33:04,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:04,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274758534] [2025-01-10 01:33:04,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:04,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:04,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:33:04,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:33:04,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:04,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:04,967 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:04,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:04,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274758534] [2025-01-10 01:33:04,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274758534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:04,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:04,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502699350] [2025-01-10 01:33:04,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:04,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:04,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:04,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:04,969 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:04,985 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-01-10 01:33:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:04,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:33:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:04,986 INFO L225 Difference]: With dead ends: 24 [2025-01-10 01:33:04,986 INFO L226 Difference]: Without dead ends: 22 [2025-01-10 01:33:04,986 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:04,987 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:04,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-10 01:33:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-01-10 01:33:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 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:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-01-10 01:33:04,990 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2025-01-10 01:33:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:04,990 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-01-10 01:33:04,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-01-10 01:33:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:33:04,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:04,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:04,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:33:04,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:04,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash 157523219, now seen corresponding path program 1 times [2025-01-10 01:33:04,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:04,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290196597] [2025-01-10 01:33:04,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:04,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:04,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:33:04,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:33:04,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:04,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:05,010 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:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290196597] [2025-01-10 01:33:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290196597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:05,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:05,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:33:05,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168998225] [2025-01-10 01:33:05,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:05,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:33:05,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:05,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:33:05,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:33:05,012 INFO L87 Difference]: Start difference. First operand 21 states and 24 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:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:05,028 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-01-10 01:33:05,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:33:05,028 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:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:05,029 INFO L225 Difference]: With dead ends: 40 [2025-01-10 01:33:05,029 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:33:05,029 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:05,030 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:05,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:33:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2025-01-10 01:33:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 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:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-01-10 01:33:05,033 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 8 [2025-01-10 01:33:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:05,033 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-01-10 01:33:05,033 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:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-01-10 01:33:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:33:05,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:05,034 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:05,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:33:05,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:05,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:05,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1840805149, now seen corresponding path program 1 times [2025-01-10 01:33:05,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:05,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102700445] [2025-01-10 01:33:05,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:05,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:05,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:33:05,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:33:05,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:05,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102700445] [2025-01-10 01:33:05,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102700445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:05,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:05,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:33:05,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420901552] [2025-01-10 01:33:05,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:05,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:33:05,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:05,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:33:05,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:33:05,093 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:05,128 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2025-01-10 01:33:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:33:05,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:33:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:05,129 INFO L225 Difference]: With dead ends: 55 [2025-01-10 01:33:05,129 INFO L226 Difference]: Without dead ends: 27 [2025-01-10 01:33:05,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:33:05,130 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:05,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-10 01:33:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-10 01:33:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 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,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-01-10 01:33:05,137 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 11 [2025-01-10 01:33:05,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:05,138 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-01-10 01:33:05,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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,140 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-01-10 01:33:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:33:05,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:05,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:33:05,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:33:05,141 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:05,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:05,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1832307292, now seen corresponding path program 1 times [2025-01-10 01:33:05,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:05,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281663331] [2025-01-10 01:33:05,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:05,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:05,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:33:05,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:33:05,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:05,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:05,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:05,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281663331] [2025-01-10 01:33:05,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281663331] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:05,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744390072] [2025-01-10 01:33:05,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:05,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:05,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:05,191 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:05,192 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:05,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:33:05,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:33:05,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:05,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:05,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:33:05,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:05,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:05,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744390072] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:05,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:05,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:33:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091184228] [2025-01-10 01:33:05,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:05,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:33:05,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:05,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:33:05,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:33:05,302 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:05,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:05,365 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2025-01-10 01:33:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:33:05,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:33:05,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:05,366 INFO L225 Difference]: With dead ends: 91 [2025-01-10 01:33:05,366 INFO L226 Difference]: Without dead ends: 89 [2025-01-10 01:33:05,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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:05,367 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:05,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 44 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:33:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-10 01:33:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2025-01-10 01:33:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 76 states have internal predecessors, (91), 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,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2025-01-10 01:33:05,374 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 14 [2025-01-10 01:33:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:05,374 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2025-01-10 01:33:05,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2025-01-10 01:33:05,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:33:05,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:05,378 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:05,384 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:05,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:05,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:05,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:05,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1938671340, now seen corresponding path program 1 times [2025-01-10 01:33:05,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:05,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248859020] [2025-01-10 01:33:05,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:33:05,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:05,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:33:05,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:33:05,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:05,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:33:05,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:05,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248859020] [2025-01-10 01:33:05,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248859020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:33:05,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:33:05,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:33:05,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897193749] [2025-01-10 01:33:05,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:33:05,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:33:05,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:05,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:33:05,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:33:05,608 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:05,624 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2025-01-10 01:33:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:33:05,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 17 [2025-01-10 01:33:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:05,625 INFO L225 Difference]: With dead ends: 104 [2025-01-10 01:33:05,625 INFO L226 Difference]: Without dead ends: 47 [2025-01-10 01:33:05,625 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:05,625 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:05,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 27 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:33:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-10 01:33:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-01-10 01:33:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:33:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2025-01-10 01:33:05,629 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 17 [2025-01-10 01:33:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:05,629 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2025-01-10 01:33:05,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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,629 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2025-01-10 01:33:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 01:33:05,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:05,630 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1] [2025-01-10 01:33:05,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:33:05,630 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:05,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1705876183, now seen corresponding path program 2 times [2025-01-10 01:33:05,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:05,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696201388] [2025-01-10 01:33:05,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:33:05,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:05,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-10 01:33:05,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:33:05,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:33:05,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:05,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:05,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696201388] [2025-01-10 01:33:05,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696201388] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:05,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620799513] [2025-01-10 01:33:05,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:33:05,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:05,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:05,715 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:05,716 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:05,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-10 01:33:05,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:33:05,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:33:05,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:05,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:33:05,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:05,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:05,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620799513] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:05,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:05,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 01:33:05,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782791410] [2025-01-10 01:33:05,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:05,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:33:05,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:05,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:33:05,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:33:05,857 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 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,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:05,927 INFO L93 Difference]: Finished difference Result 188 states and 227 transitions. [2025-01-10 01:33:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:33:05,927 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 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 32 [2025-01-10 01:33:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:05,928 INFO L225 Difference]: With dead ends: 188 [2025-01-10 01:33:05,928 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 01:33:05,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 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:05,929 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 60 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:05,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 87 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:33:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 01:33:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-10 01:33:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.0625) internal successors, (85), 81 states have internal predecessors, (85), 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,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2025-01-10 01:33:05,933 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 32 [2025-01-10 01:33:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:05,933 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2025-01-10 01:33:05,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 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,933 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2025-01-10 01:33:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 01:33:05,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:05,934 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 1, 1, 1] [2025-01-10 01:33:05,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:33:06,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:06,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:06,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:06,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1255751933, now seen corresponding path program 3 times [2025-01-10 01:33:06,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:06,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736901973] [2025-01-10 01:33:06,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:33:06,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:06,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 11 equivalence classes. [2025-01-10 01:33:06,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 01:33:06,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:33:06,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:06,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:06,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736901973] [2025-01-10 01:33:06,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736901973] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:06,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336775012] [2025-01-10 01:33:06,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:33:06,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:06,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:06,328 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:06,329 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:06,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 11 equivalence classes. [2025-01-10 01:33:06,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 01:33:06,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:33:06,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:06,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:33:06,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:06,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336775012] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:06,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:06,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-01-10 01:33:06,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356232137] [2025-01-10 01:33:06,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:06,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:33:06,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:06,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:33:06,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:33:06,676 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 24 states, 23 states have (on average 5.869565217391305) internal successors, (135), 24 states have internal predecessors, (135), 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:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:06,830 INFO L93 Difference]: Finished difference Result 404 states and 491 transitions. [2025-01-10 01:33:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:33:06,831 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.869565217391305) internal successors, (135), 24 states have internal predecessors, (135), 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 68 [2025-01-10 01:33:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:06,832 INFO L225 Difference]: With dead ends: 404 [2025-01-10 01:33:06,832 INFO L226 Difference]: Without dead ends: 154 [2025-01-10 01:33:06,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 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:06,833 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 144 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:06,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 197 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:33:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-10 01:33:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-01-10 01:33:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 152 states have (on average 1.0328947368421053) internal successors, (157), 153 states have internal predecessors, (157), 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:06,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 157 transitions. [2025-01-10 01:33:06,844 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 157 transitions. Word has length 68 [2025-01-10 01:33:06,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:06,844 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 157 transitions. [2025-01-10 01:33:06,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.869565217391305) internal successors, (135), 24 states have internal predecessors, (135), 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:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 157 transitions. [2025-01-10 01:33:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-10 01:33:06,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:06,847 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 22, 1, 1, 1] [2025-01-10 01:33:06,852 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:07,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:07,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:07,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:07,048 INFO L85 PathProgramCache]: Analyzing trace with hash -364037047, now seen corresponding path program 4 times [2025-01-10 01:33:07,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:07,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61769737] [2025-01-10 01:33:07,049 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:33:07,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:07,057 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 140 statements into 2 equivalence classes. [2025-01-10 01:33:07,086 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 140 of 140 statements. [2025-01-10 01:33:07,086 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:33:07,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 0 proven. 1518 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:07,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:07,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61769737] [2025-01-10 01:33:07,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61769737] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:07,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053003000] [2025-01-10 01:33:07,617 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:33:07,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:07,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:07,618 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:07,620 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:07,644 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 140 statements into 2 equivalence classes. [2025-01-10 01:33:07,665 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 140 of 140 statements. [2025-01-10 01:33:07,665 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:33:07,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:07,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 01:33:07,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 0 proven. 1518 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:07,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 0 proven. 1518 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:08,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053003000] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:08,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:08,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-01-10 01:33:08,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951772082] [2025-01-10 01:33:08,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:08,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-10 01:33:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:08,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 01:33:08,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:33:08,616 INFO L87 Difference]: Start difference. First operand 154 states and 157 transitions. Second operand has 48 states, 47 states have (on average 5.9361702127659575) internal successors, (279), 48 states have internal predecessors, (279), 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:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:09,010 INFO L93 Difference]: Finished difference Result 836 states and 1019 transitions. [2025-01-10 01:33:09,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 01:33:09,011 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 5.9361702127659575) internal successors, (279), 48 states have internal predecessors, (279), 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 140 [2025-01-10 01:33:09,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:09,013 INFO L225 Difference]: With dead ends: 836 [2025-01-10 01:33:09,013 INFO L226 Difference]: Without dead ends: 298 [2025-01-10 01:33:09,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 256 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:09,018 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 288 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:09,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 483 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:33:09,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-01-10 01:33:09,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-01-10 01:33:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 296 states have (on average 1.0168918918918919) internal successors, (301), 297 states have internal predecessors, (301), 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:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 301 transitions. [2025-01-10 01:33:09,038 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 301 transitions. Word has length 140 [2025-01-10 01:33:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:09,038 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 301 transitions. [2025-01-10 01:33:09,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 5.9361702127659575) internal successors, (279), 48 states have internal predecessors, (279), 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:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 301 transitions. [2025-01-10 01:33:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-01-10 01:33:09,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:09,045 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 46, 1, 1, 1] [2025-01-10 01:33:09,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:33:09,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:33:09,245 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:09,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash 634515169, now seen corresponding path program 5 times [2025-01-10 01:33:09,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:09,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910205667] [2025-01-10 01:33:09,246 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:33:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:09,272 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 284 statements into 47 equivalence classes. [2025-01-10 01:33:09,360 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 284 of 284 statements. [2025-01-10 01:33:09,360 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:33:09,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6486 backedges. 0 proven. 6486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:11,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:11,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910205667] [2025-01-10 01:33:11,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910205667] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:11,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532031018] [2025-01-10 01:33:11,230 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:33:11,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:11,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:11,235 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:11,237 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:11,262 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 284 statements into 47 equivalence classes. [2025-01-10 01:33:11,325 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 284 of 284 statements. [2025-01-10 01:33:11,326 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:33:11,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:11,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 01:33:11,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6486 backedges. 0 proven. 6486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:11,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6486 backedges. 0 proven. 6486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:14,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532031018] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:14,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 01:33:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161178521] [2025-01-10 01:33:14,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:14,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 01:33:14,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:14,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 01:33:14,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:33:14,315 INFO L87 Difference]: Start difference. First operand 298 states and 301 transitions. Second operand has 96 states, 95 states have (on average 5.968421052631579) internal successors, (567), 96 states have internal predecessors, (567), 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:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:15,304 INFO L93 Difference]: Finished difference Result 1700 states and 2075 transitions. [2025-01-10 01:33:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 01:33:15,304 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 5.968421052631579) internal successors, (567), 96 states have internal predecessors, (567), 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 284 [2025-01-10 01:33:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:15,307 INFO L225 Difference]: With dead ends: 1700 [2025-01-10 01:33:15,307 INFO L226 Difference]: Without dead ends: 586 [2025-01-10 01:33:15,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:33:15,311 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 792 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:15,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 969 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 01:33:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-01-10 01:33:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-01-10 01:33:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 584 states have (on average 1.0085616438356164) internal successors, (589), 585 states have internal predecessors, (589), 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:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 589 transitions. [2025-01-10 01:33:15,335 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 589 transitions. Word has length 284 [2025-01-10 01:33:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:15,335 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 589 transitions. [2025-01-10 01:33:15,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 5.968421052631579) internal successors, (567), 96 states have internal predecessors, (567), 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:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 589 transitions. [2025-01-10 01:33:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-01-10 01:33:15,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:15,343 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 95, 94, 1, 1, 1] [2025-01-10 01:33:15,352 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:15,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 01:33:15,549 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:15,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash 178144273, now seen corresponding path program 6 times [2025-01-10 01:33:15,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:15,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068746101] [2025-01-10 01:33:15,550 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:33:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:15,564 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 572 statements into 95 equivalence classes. [2025-01-10 01:33:15,645 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 572 of 572 statements. [2025-01-10 01:33:15,645 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:33:15,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 26790 backedges. 0 proven. 26790 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:21,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:21,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068746101] [2025-01-10 01:33:21,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068746101] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:21,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441797306] [2025-01-10 01:33:21,141 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:33:21,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:21,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:21,143 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:21,144 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:21,187 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 572 statements into 95 equivalence classes. [2025-01-10 01:33:21,344 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 572 of 572 statements. [2025-01-10 01:33:21,344 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:33:21,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:21,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-10 01:33:21,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 26790 backedges. 0 proven. 26790 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:21,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 26790 backedges. 0 proven. 26790 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:30,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441797306] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:30,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:30,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-01-10 01:33:30,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371965945] [2025-01-10 01:33:30,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:30,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-01-10 01:33:30,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:30,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-01-10 01:33:30,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:33:30,610 INFO L87 Difference]: Start difference. First operand 586 states and 589 transitions. Second operand has 192 states, 191 states have (on average 5.984293193717278) internal successors, (1143), 192 states have internal predecessors, (1143), 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:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:35,900 INFO L93 Difference]: Finished difference Result 3428 states and 4187 transitions. [2025-01-10 01:33:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-01-10 01:33:35,901 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 5.984293193717278) internal successors, (1143), 192 states have internal predecessors, (1143), 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 572 [2025-01-10 01:33:35,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:35,904 INFO L225 Difference]: With dead ends: 3428 [2025-01-10 01:33:35,905 INFO L226 Difference]: Without dead ends: 1162 [2025-01-10 01:33:35,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1238 GetRequests, 1048 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:33:35,908 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 1856 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:35,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 2327 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 01:33:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-01-10 01:33:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2025-01-10 01:33:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1160 states have (on average 1.0043103448275863) internal successors, (1165), 1161 states have internal predecessors, (1165), 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:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1165 transitions. [2025-01-10 01:33:35,930 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1165 transitions. Word has length 572 [2025-01-10 01:33:35,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:35,931 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1165 transitions. [2025-01-10 01:33:35,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 5.984293193717278) internal successors, (1143), 192 states have internal predecessors, (1143), 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:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1165 transitions. [2025-01-10 01:33:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1149 [2025-01-10 01:33:35,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:35,955 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 191, 190, 1, 1, 1] [2025-01-10 01:33:35,962 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:36,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:33:36,157 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:33:36,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:36,159 INFO L85 PathProgramCache]: Analyzing trace with hash 96644721, now seen corresponding path program 7 times [2025-01-10 01:33:36,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:36,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463553540] [2025-01-10 01:33:36,159 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:33:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:36,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1148 statements into 1 equivalence classes. [2025-01-10 01:33:36,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1148 of 1148 statements. [2025-01-10 01:33:36,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:36,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 108870 backedges. 0 proven. 108870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:33:59,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463553540] [2025-01-10 01:33:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463553540] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938651992] [2025-01-10 01:33:59,612 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:33:59,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:59,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:59,614 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:59,615 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:59,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1148 statements into 1 equivalence classes. [2025-01-10 01:33:59,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1148 of 1148 statements. [2025-01-10 01:33:59,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:59,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:59,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-01-10 01:33:59,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:34:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 108870 backedges. 0 proven. 108870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:34:00,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:34:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 108870 backedges. 0 proven. 108870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:34:34,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938651992] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:34:34,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:34:34,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-01-10 01:34:34,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642025981] [2025-01-10 01:34:34,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:34:34,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-01-10 01:34:34,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:34:34,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-01-10 01:34:34,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-01-10 01:34:34,394 INFO L87 Difference]: Start difference. First operand 1162 states and 1165 transitions. Second operand has 384 states, 383 states have (on average 5.992167101827676) internal successors, (2295), 384 states have internal predecessors, (2295), 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)