./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/easy2-2.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-crafted/easy2-2.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 0ba0e3ec7d24c78a29a4980275f3f450c6adf9cab13a788bc587b5f2c8c6cbd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:27:48,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:27:48,685 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:27:48,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:27:48,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:27:48,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:27:48,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:27:48,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:27:48,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:27:48,714 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:27:48,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:27:48,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:27:48,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:27:48,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:27:48,716 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:27:48,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:27:48,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:27:48,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:27:48,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:27:48,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:27:48,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:27:48,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:27:48,717 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:27:48,718 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:27:48,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:27:48,718 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:27:48,718 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:27:48,718 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:27:48,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:27:48,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:27:48,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:27:48,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:27:48,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:27:48,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:27:48,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:27:48,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:27:48,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:27:48,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:27:48,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:27:48,719 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:27:48,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:27:48,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:27:48,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:27:48,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:27:48,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:27:48,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:27:48,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:27:48,720 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 -> 0ba0e3ec7d24c78a29a4980275f3f450c6adf9cab13a788bc587b5f2c8c6cbd4 [2025-01-10 01:27:48,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:27:48,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:27:48,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:27:48,979 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:27:48,980 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:27:48,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/easy2-2.c [2025-01-10 01:27:50,102 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/414d1c536/5bbf624ce18d413785eb4e06aa5465e5/FLAGfe662673c [2025-01-10 01:27:50,340 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:27:50,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/easy2-2.c [2025-01-10 01:27:50,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/414d1c536/5bbf624ce18d413785eb4e06aa5465e5/FLAGfe662673c [2025-01-10 01:27:50,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/414d1c536/5bbf624ce18d413785eb4e06aa5465e5 [2025-01-10 01:27:50,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:27:50,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:27:50,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:27:50,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:27:50,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:27:50,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1394ecbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50, skipping insertion in model container [2025-01-10 01:27:50,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:27:50,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:27:50,790 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:27:50,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:27:50,805 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:27:50,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50 WrapperNode [2025-01-10 01:27:50,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:27:50,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:27:50,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:27:50,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:27:50,811 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:27:50" (1/1) ... [2025-01-10 01:27:50,813 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:27:50" (1/1) ... [2025-01-10 01:27:50,822 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2025-01-10 01:27:50,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:27:50,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:27:50,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:27:50,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:27:50,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,832 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 01:27:50,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:27:50,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:27:50,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:27:50,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:27:50,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50" (1/1) ... [2025-01-10 01:27:50,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:27:50,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:27:50,863 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:27:50,865 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:27:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:27:50,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:27:50,926 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:27:50,927 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:27:50,988 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-10 01:27:50,989 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:27:50,994 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:27:50,995 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:27:50,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:27:50 BoogieIcfgContainer [2025-01-10 01:27:50,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:27:50,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:27:50,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:27:51,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:27:51,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:27:50" (1/3) ... [2025-01-10 01:27:51,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd904d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:27:51, skipping insertion in model container [2025-01-10 01:27:51,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:27:50" (2/3) ... [2025-01-10 01:27:51,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd904d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:27:51, skipping insertion in model container [2025-01-10 01:27:51,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:27:50" (3/3) ... [2025-01-10 01:27:51,002 INFO L128 eAbstractionObserver]: Analyzing ICFG easy2-2.c [2025-01-10 01:27:51,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:27:51,013 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG easy2-2.c that has 1 procedures, 18 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-01-10 01:27:51,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:27:51,061 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;@523b9f5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:27:51,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:27:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 17 states have internal predecessors, (18), 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:27:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:27:51,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:51,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:27:51,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:51,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:51,077 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-01-10 01:27:51,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:51,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457980680] [2025-01-10 01:27:51,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:27:51,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:51,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:27:51,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:27:51,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:27:51,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:51,194 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:27:51,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:51,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457980680] [2025-01-10 01:27:51,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457980680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:27:51,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:27:51,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:27:51,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747293550] [2025-01-10 01:27:51,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:27:51,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:27:51,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:51,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:27:51,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:27:51,218 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:27:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:51,241 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-01-10 01:27:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:27:51,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 01:27:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:51,247 INFO L225 Difference]: With dead ends: 18 [2025-01-10 01:27:51,247 INFO L226 Difference]: Without dead ends: 14 [2025-01-10 01:27:51,249 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:27:51,251 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:51,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:27:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-01-10 01:27:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-01-10 01:27:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:27:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-01-10 01:27:51,273 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2025-01-10 01:27:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:51,273 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-01-10 01:27:51,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:27:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-01-10 01:27:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:27:51,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:51,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:27:51,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:27:51,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:51,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:51,275 INFO L85 PathProgramCache]: Analyzing trace with hash 28694756, now seen corresponding path program 1 times [2025-01-10 01:27:51,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:51,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370748630] [2025-01-10 01:27:51,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:27:51,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:51,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:27:51,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:27:51,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:27:51,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:51,302 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:27:51,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:51,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370748630] [2025-01-10 01:27:51,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370748630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:27:51,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:27:51,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:27:51,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666800167] [2025-01-10 01:27:51,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:27:51,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:27:51,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:51,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:27:51,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:27:51,305 INFO L87 Difference]: Start difference. First operand 14 states and 14 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:27:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:51,315 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-01-10 01:27:51,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:27:51,316 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:27:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:51,316 INFO L225 Difference]: With dead ends: 18 [2025-01-10 01:27:51,316 INFO L226 Difference]: Without dead ends: 17 [2025-01-10 01:27:51,316 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:27:51,317 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:51,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:27:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-01-10 01:27:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-01-10 01:27:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 16 states have internal predecessors, (17), 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:27:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-01-10 01:27:51,320 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 5 [2025-01-10 01:27:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:51,320 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-01-10 01:27:51,320 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:27:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-01-10 01:27:51,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:27:51,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:51,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:27:51,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:27:51,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:51,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash 889537478, now seen corresponding path program 1 times [2025-01-10 01:27:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:51,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777376077] [2025-01-10 01:27:51,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:27:51,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:51,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:27:51,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:27:51,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:27:51,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:51,355 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:27:51,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:51,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777376077] [2025-01-10 01:27:51,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777376077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:27:51,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:27:51,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:27:51,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181112753] [2025-01-10 01:27:51,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:27:51,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:27:51,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:51,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:27:51,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:27:51,357 INFO L87 Difference]: Start difference. First operand 17 states and 17 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:27:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:51,368 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-01-10 01:27:51,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:27:51,369 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:27:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:51,370 INFO L225 Difference]: With dead ends: 20 [2025-01-10 01:27:51,370 INFO L226 Difference]: Without dead ends: 19 [2025-01-10 01:27:51,370 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:27:51,370 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:51,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:27:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-10 01:27:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-01-10 01:27:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 17 states have internal predecessors, (18), 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:27:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-01-10 01:27:51,373 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 6 [2025-01-10 01:27:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:51,373 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-01-10 01:27:51,373 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:27:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-01-10 01:27:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:27:51,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:51,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:27:51,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:27:51,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:51,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:51,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1805858086, now seen corresponding path program 1 times [2025-01-10 01:27:51,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:51,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361705556] [2025-01-10 01:27:51,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:27:51,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:51,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:27:51,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:27:51,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:27:51,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:51,401 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:27:51,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:51,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361705556] [2025-01-10 01:27:51,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361705556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:27:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:27:51,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:27:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466266086] [2025-01-10 01:27:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:27:51,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:27:51,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:51,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:27:51,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:27:51,403 INFO L87 Difference]: Start difference. First operand 18 states and 18 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:27:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:51,412 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-01-10 01:27:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:27:51,413 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:27:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:51,413 INFO L225 Difference]: With dead ends: 18 [2025-01-10 01:27:51,413 INFO L226 Difference]: Without dead ends: 17 [2025-01-10 01:27:51,414 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:27:51,414 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:51,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:27:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-01-10 01:27:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-01-10 01:27:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 16 states have internal predecessors, (17), 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:27:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-01-10 01:27:51,417 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2025-01-10 01:27:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:51,417 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-01-10 01:27:51,417 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:27:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-01-10 01:27:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:27:51,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:51,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:27:51,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:27:51,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:51,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:51,418 INFO L85 PathProgramCache]: Analyzing trace with hash 147025864, now seen corresponding path program 1 times [2025-01-10 01:27:51,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:51,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163984995] [2025-01-10 01:27:51,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:27:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:51,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:27:51,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:27:51,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:27:51,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:51,451 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:27:51,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:51,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163984995] [2025-01-10 01:27:51,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163984995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:27:51,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:27:51,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:27:51,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946942330] [2025-01-10 01:27:51,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:27:51,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:27:51,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:51,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:27:51,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:27:51,455 INFO L87 Difference]: Start difference. First operand 17 states and 17 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:27:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:51,462 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2025-01-10 01:27:51,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:27:51,463 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:27:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:51,463 INFO L225 Difference]: With dead ends: 17 [2025-01-10 01:27:51,463 INFO L226 Difference]: Without dead ends: 16 [2025-01-10 01:27:51,463 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:27:51,464 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:51,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:27:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-10 01:27:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-10 01:27:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 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:27:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-01-10 01:27:51,467 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2025-01-10 01:27:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:51,467 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-01-10 01:27:51,468 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:27:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-01-10 01:27:51,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:27:51,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:51,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:27:51,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:27:51,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:51,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:51,470 INFO L85 PathProgramCache]: Analyzing trace with hash 262834536, now seen corresponding path program 1 times [2025-01-10 01:27:51,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:51,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926400945] [2025-01-10 01:27:51,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:27:51,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:51,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:27:51,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:27:51,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:27:51,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:51,515 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:27:51,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:51,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926400945] [2025-01-10 01:27:51,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926400945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:27:51,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:27:51,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:27:51,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579257606] [2025-01-10 01:27:51,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:27:51,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:27:51,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:51,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:27:51,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:27:51,516 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:27:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:51,526 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-01-10 01:27:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:27:51,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 01:27:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:51,529 INFO L225 Difference]: With dead ends: 16 [2025-01-10 01:27:51,529 INFO L226 Difference]: Without dead ends: 15 [2025-01-10 01:27:51,529 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:27:51,529 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:51,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:27:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-10 01:27:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-10 01:27:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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:27:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-01-10 01:27:51,532 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 9 [2025-01-10 01:27:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:51,532 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-01-10 01:27:51,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:27:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-01-10 01:27:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:27:51,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:51,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:27:51,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:27:51,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:51,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash 378317182, now seen corresponding path program 1 times [2025-01-10 01:27:51,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:51,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956642388] [2025-01-10 01:27:51,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:27:51,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:51,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:27:51,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:27:51,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:27:51,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:51,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:51,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956642388] [2025-01-10 01:27:51,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956642388] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:27:51,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486648692] [2025-01-10 01:27:51,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:27:51,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:51,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:27:51,578 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:27:51,579 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:27:51,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:27:51,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:27:51,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:27:51,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:51,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:27:51,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:27:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:51,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:27:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:51,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486648692] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:27:51,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:27:51,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:27:51,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246817360] [2025-01-10 01:27:51,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:27:51,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:27:51,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:51,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:27:51,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:27:51,683 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:27:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:51,702 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2025-01-10 01:27:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:27:51,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 01:27:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:51,703 INFO L225 Difference]: With dead ends: 38 [2025-01-10 01:27:51,703 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 01:27:51,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 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:27:51,704 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:51,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:27:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 01:27:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-01-10 01:27:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 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:27:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-01-10 01:27:51,710 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 12 [2025-01-10 01:27:51,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:51,710 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-01-10 01:27:51,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:27:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-01-10 01:27:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:27:51,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:51,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:27:51,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:27:51,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:51,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:51,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1157069204, now seen corresponding path program 1 times [2025-01-10 01:27:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:51,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515757949] [2025-01-10 01:27:51,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:27:51,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:51,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:27:51,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:27:51,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:27:51,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:51,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515757949] [2025-01-10 01:27:51,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515757949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:27:51,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725077258] [2025-01-10 01:27:51,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:27:51,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:51,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:27:51,967 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:27:51,968 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:27:51,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:27:51,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:27:51,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:27:51,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:51,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:27:51,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:27:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:52,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:27:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:52,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725077258] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:27:52,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:27:52,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:27:52,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365182990] [2025-01-10 01:27:52,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:27:52,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:27:52,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:52,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:27:52,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:27:52,071 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:27:52,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:52,089 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2025-01-10 01:27:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:27:52,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:27:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:52,090 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:27:52,090 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:27:52,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:27:52,091 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:52,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:27:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:27:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-10 01:27:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:27:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2025-01-10 01:27:52,094 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 13 [2025-01-10 01:27:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:52,094 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2025-01-10 01:27:52,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:27:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2025-01-10 01:27:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 01:27:52,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:52,095 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2025-01-10 01:27:52,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:27:52,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:52,299 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:52,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:52,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1299773852, now seen corresponding path program 2 times [2025-01-10 01:27:52,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:52,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594988160] [2025-01-10 01:27:52,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:27:52,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:52,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:27:52,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:27:52,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:27:52,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:52,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:52,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594988160] [2025-01-10 01:27:52,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594988160] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:27:52,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752986937] [2025-01-10 01:27:52,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:27:52,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:52,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:27:52,406 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:27:52,408 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:27:52,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:27:52,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:27:52,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:27:52,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:52,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:27:52,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:27:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:52,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:27:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752986937] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:27:52,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:27:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 01:27:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593300395] [2025-01-10 01:27:52,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:27:52,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:27:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:52,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:27:52,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:27:52,639 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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:27:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:52,682 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2025-01-10 01:27:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:27:52,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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 33 [2025-01-10 01:27:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:52,684 INFO L225 Difference]: With dead ends: 83 [2025-01-10 01:27:52,684 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 01:27:52,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 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:27:52,685 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:52,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 70 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:27:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 01:27:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2025-01-10 01:27:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 76 states have internal predecessors, (82), 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:27:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2025-01-10 01:27:52,691 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 33 [2025-01-10 01:27:52,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:52,693 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2025-01-10 01:27:52,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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:27:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2025-01-10 01:27:52,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 01:27:52,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:52,695 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1] [2025-01-10 01:27:52,701 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:27:52,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:52,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:52,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:52,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1638283706, now seen corresponding path program 2 times [2025-01-10 01:27:52,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:52,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252492015] [2025-01-10 01:27:52,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:27:52,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:52,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:27:52,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:27:52,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:27:52,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:52,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:52,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252492015] [2025-01-10 01:27:52,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252492015] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:27:52,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707409665] [2025-01-10 01:27:52,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:27:52,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:52,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:27:52,980 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:27:52,982 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:27:52,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:27:53,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:27:53,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:27:53,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:53,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:27:53,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:27:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:53,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:27:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707409665] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:27:53,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:27:53,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 01:27:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255813276] [2025-01-10 01:27:53,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:27:53,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:27:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:53,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:27:53,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:27:53,172 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 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:27:53,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:53,223 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2025-01-10 01:27:53,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:27:53,223 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 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 34 [2025-01-10 01:27:53,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:53,225 INFO L225 Difference]: With dead ends: 79 [2025-01-10 01:27:53,225 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 01:27:53,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 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:27:53,226 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:53,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:27:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 01:27:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-10 01:27:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 77 states have internal predecessors, (78), 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:27:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2025-01-10 01:27:53,247 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 34 [2025-01-10 01:27:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:53,247 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2025-01-10 01:27:53,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 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:27:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2025-01-10 01:27:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 01:27:53,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:53,249 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1] [2025-01-10 01:27:53,263 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:27:53,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:27:53,449 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1575701852, now seen corresponding path program 3 times [2025-01-10 01:27:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:53,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212120576] [2025-01-10 01:27:53,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:27:53,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:53,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 11 equivalence classes. [2025-01-10 01:27:53,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 01:27:53,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:27:53,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:53,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:53,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212120576] [2025-01-10 01:27:53,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212120576] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:27:53,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100840291] [2025-01-10 01:27:53,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:27:53,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:53,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:27:53,655 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:27:53,657 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:27:53,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 11 equivalence classes. [2025-01-10 01:27:53,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 01:27:53,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:27:53,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:53,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:27:53,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:27:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:53,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:27:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100840291] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:27:54,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:27:54,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-01-10 01:27:54,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455954223] [2025-01-10 01:27:54,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:27:54,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:27:54,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:54,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:27:54,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:27:54,035 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand has 24 states, 23 states have (on average 6.478260869565218) internal successors, (149), 24 states have internal predecessors, (149), 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:27:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:54,109 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2025-01-10 01:27:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:27:54,109 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.478260869565218) internal successors, (149), 24 states have internal predecessors, (149), 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 75 [2025-01-10 01:27:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:54,110 INFO L225 Difference]: With dead ends: 173 [2025-01-10 01:27:54,110 INFO L226 Difference]: Without dead ends: 172 [2025-01-10 01:27:54,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 138 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:27:54,111 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:54,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 141 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:27:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-10 01:27:54,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 161. [2025-01-10 01:27:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.0817610062893082) internal successors, (172), 160 states have internal predecessors, (172), 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:27:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 172 transitions. [2025-01-10 01:27:54,119 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 172 transitions. Word has length 75 [2025-01-10 01:27:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:54,119 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 172 transitions. [2025-01-10 01:27:54,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.478260869565218) internal successors, (149), 24 states have internal predecessors, (149), 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:27:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2025-01-10 01:27:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 01:27:54,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:54,120 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 1, 1, 1] [2025-01-10 01:27:54,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:27:54,320 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,SelfDestructingSolverStorable10 [2025-01-10 01:27:54,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:54,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:54,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1602117114, now seen corresponding path program 3 times [2025-01-10 01:27:54,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:54,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120031548] [2025-01-10 01:27:54,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:27:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:54,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 11 equivalence classes. [2025-01-10 01:27:54,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 01:27:54,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:27:54,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:54,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:54,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120031548] [2025-01-10 01:27:54,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120031548] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:27:54,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265220668] [2025-01-10 01:27:54,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:27:54,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:54,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:27:54,486 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:27:54,488 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:27:54,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 11 equivalence classes. [2025-01-10 01:27:54,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 01:27:54,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:27:54,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:54,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:27:54,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:27:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:54,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:27:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265220668] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:27:54,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:27:54,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-01-10 01:27:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465291952] [2025-01-10 01:27:54,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:27:54,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:27:54,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:54,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:27:54,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:27:54,856 INFO L87 Difference]: Start difference. First operand 161 states and 172 transitions. Second operand has 24 states, 23 states have (on average 6.565217391304348) internal successors, (151), 24 states have internal predecessors, (151), 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:27:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:54,912 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2025-01-10 01:27:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:27:54,913 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.565217391304348) internal successors, (151), 24 states have internal predecessors, (151), 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 76 [2025-01-10 01:27:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:54,913 INFO L225 Difference]: With dead ends: 163 [2025-01-10 01:27:54,913 INFO L226 Difference]: Without dead ends: 162 [2025-01-10 01:27:54,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 140 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:27:54,914 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:54,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 127 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:27:54,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-10 01:27:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-01-10 01:27:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 160 states have (on average 1.0125) internal successors, (162), 161 states have internal predecessors, (162), 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:27:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2025-01-10 01:27:54,927 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 76 [2025-01-10 01:27:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:54,927 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2025-01-10 01:27:54,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.565217391304348) internal successors, (151), 24 states have internal predecessors, (151), 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:27:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2025-01-10 01:27:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-10 01:27:54,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:54,928 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 1, 1, 1] [2025-01-10 01:27:54,936 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:27:55,128 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,SelfDestructingSolverStorable11 [2025-01-10 01:27:55,129 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:55,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:55,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1411245276, now seen corresponding path program 4 times [2025-01-10 01:27:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:55,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477429167] [2025-01-10 01:27:55,129 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:27:55,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:55,139 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-01-10 01:27:55,149 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-01-10 01:27:55,150 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:27:55,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:55,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:55,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477429167] [2025-01-10 01:27:55,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477429167] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:27:55,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981100003] [2025-01-10 01:27:55,633 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:27:55,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:55,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:27:55,635 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:27:55,636 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:27:55,661 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-01-10 01:27:55,691 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-01-10 01:27:55,691 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:27:55,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:55,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 01:27:55,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:27:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:55,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:27:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:56,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981100003] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:27:56,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:27:56,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-01-10 01:27:56,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226306067] [2025-01-10 01:27:56,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:27:56,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-10 01:27:56,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:56,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 01:27:56,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:27:56,577 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand has 48 states, 47 states have (on average 6.74468085106383) internal successors, (317), 48 states have internal predecessors, (317), 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:27:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:56,712 INFO L93 Difference]: Finished difference Result 353 states and 376 transitions. [2025-01-10 01:27:56,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 01:27:56,713 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 6.74468085106383) internal successors, (317), 48 states have internal predecessors, (317), 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 159 [2025-01-10 01:27:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:56,714 INFO L225 Difference]: With dead ends: 353 [2025-01-10 01:27:56,714 INFO L226 Difference]: Without dead ends: 352 [2025-01-10 01:27:56,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 294 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:27:56,715 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:56,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 269 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:27:56,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-01-10 01:27:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 329. [2025-01-10 01:27:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 327 states have (on average 1.0764525993883791) internal successors, (352), 328 states have internal predecessors, (352), 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:27:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 352 transitions. [2025-01-10 01:27:56,724 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 352 transitions. Word has length 159 [2025-01-10 01:27:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:56,725 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 352 transitions. [2025-01-10 01:27:56,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 6.74468085106383) internal successors, (317), 48 states have internal predecessors, (317), 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:27:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 352 transitions. [2025-01-10 01:27:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-10 01:27:56,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:56,726 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 1, 1, 1] [2025-01-10 01:27:56,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:27:56,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:56,930 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:56,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash -798930554, now seen corresponding path program 4 times [2025-01-10 01:27:56,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:56,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647996856] [2025-01-10 01:27:56,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:27:56,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:56,939 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 160 statements into 2 equivalence classes. [2025-01-10 01:27:56,949 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-01-10 01:27:56,949 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:27:56,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:57,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:57,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647996856] [2025-01-10 01:27:57,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647996856] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:27:57,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799373671] [2025-01-10 01:27:57,505 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:27:57,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:57,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:27:57,507 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:27:57,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:27:57,529 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 160 statements into 2 equivalence classes. [2025-01-10 01:27:57,554 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-01-10 01:27:57,554 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:27:57,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:57,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 01:27:57,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:27:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:57,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:27:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:58,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799373671] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:27:58,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:27:58,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-01-10 01:27:58,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778794279] [2025-01-10 01:27:58,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:27:58,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-10 01:27:58,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:58,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 01:27:58,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:27:58,511 INFO L87 Difference]: Start difference. First operand 329 states and 352 transitions. Second operand has 48 states, 47 states have (on average 6.787234042553192) internal successors, (319), 48 states have internal predecessors, (319), 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:27:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:27:58,650 INFO L93 Difference]: Finished difference Result 331 states and 354 transitions. [2025-01-10 01:27:58,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 01:27:58,650 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 6.787234042553192) internal successors, (319), 48 states have internal predecessors, (319), 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 160 [2025-01-10 01:27:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:27:58,652 INFO L225 Difference]: With dead ends: 331 [2025-01-10 01:27:58,652 INFO L226 Difference]: Without dead ends: 330 [2025-01-10 01:27:58,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 296 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:27:58,653 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:27:58,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 245 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:27:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-10 01:27:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-01-10 01:27:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 328 states have (on average 1.0060975609756098) internal successors, (330), 329 states have internal predecessors, (330), 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:27:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2025-01-10 01:27:58,661 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 160 [2025-01-10 01:27:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:27:58,662 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2025-01-10 01:27:58,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 6.787234042553192) internal successors, (319), 48 states have internal predecessors, (319), 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:27:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2025-01-10 01:27:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-10 01:27:58,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:27:58,668 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 1, 1, 1] [2025-01-10 01:27:58,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:27:58,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:58,869 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:27:58,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:27:58,869 INFO L85 PathProgramCache]: Analyzing trace with hash 188034084, now seen corresponding path program 5 times [2025-01-10 01:27:58,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:27:58,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113321486] [2025-01-10 01:27:58,869 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:27:58,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:27:58,879 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 327 statements into 47 equivalence classes. [2025-01-10 01:27:58,984 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 327 of 327 statements. [2025-01-10 01:27:58,984 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:27:58,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:28:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7383 backedges. 0 proven. 7383 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:28:00,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:28:00,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113321486] [2025-01-10 01:28:00,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113321486] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:28:00,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252873378] [2025-01-10 01:28:00,423 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:28:00,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:28:00,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:28:00,426 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:28:00,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:28:00,452 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 327 statements into 47 equivalence classes. [2025-01-10 01:28:00,538 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 327 of 327 statements. [2025-01-10 01:28:00,538 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:28:00,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:28:00,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 01:28:00,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:28:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7383 backedges. 0 proven. 7383 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:28:00,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:28:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7383 backedges. 0 proven. 7383 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:28:02,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252873378] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:28:02,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:28:02,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 01:28:02,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32890710] [2025-01-10 01:28:02,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:28:02,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 01:28:02,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:28:02,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 01:28:02,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:28:02,928 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand has 96 states, 95 states have (on average 6.873684210526315) internal successors, (653), 96 states have internal predecessors, (653), 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:28:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:28:03,306 INFO L93 Difference]: Finished difference Result 713 states and 760 transitions. [2025-01-10 01:28:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 01:28:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 6.873684210526315) internal successors, (653), 96 states have internal predecessors, (653), 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 327 [2025-01-10 01:28:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:28:03,309 INFO L225 Difference]: With dead ends: 713 [2025-01-10 01:28:03,309 INFO L226 Difference]: Without dead ends: 712 [2025-01-10 01:28:03,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:28:03,313 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 153 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:28:03,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 540 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:28:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-01-10 01:28:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 665. [2025-01-10 01:28:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 663 states have (on average 1.0739064856711915) internal successors, (712), 664 states have internal predecessors, (712), 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:28:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 712 transitions. [2025-01-10 01:28:03,325 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 712 transitions. Word has length 327 [2025-01-10 01:28:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:28:03,325 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 712 transitions. [2025-01-10 01:28:03,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 6.873684210526315) internal successors, (653), 96 states have internal predecessors, (653), 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:28:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 712 transitions. [2025-01-10 01:28:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-10 01:28:03,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:28:03,328 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 1, 1, 1] [2025-01-10 01:28:03,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:28:03,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:28:03,530 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:28:03,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:28:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1534089350, now seen corresponding path program 5 times [2025-01-10 01:28:03,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:28:03,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324383693] [2025-01-10 01:28:03,531 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:28:03,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:28:03,541 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 328 statements into 47 equivalence classes. [2025-01-10 01:28:03,601 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 328 of 328 statements. [2025-01-10 01:28:03,601 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:28:03,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:28:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 7429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:28:04,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:28:04,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324383693] [2025-01-10 01:28:04,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324383693] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:28:04,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329596203] [2025-01-10 01:28:04,873 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:28:04,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:28:04,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:28:04,874 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:28:04,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:28:04,899 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 328 statements into 47 equivalence classes. [2025-01-10 01:28:04,972 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 328 of 328 statements. [2025-01-10 01:28:04,972 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:28:04,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:28:04,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 01:28:04,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:28:05,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 7429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:28:05,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:28:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 7429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:28:07,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329596203] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:28:07,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:28:07,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 01:28:07,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401066086] [2025-01-10 01:28:07,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:28:07,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 01:28:07,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:28:07,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 01:28:07,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:28:07,277 INFO L87 Difference]: Start difference. First operand 665 states and 712 transitions. Second operand has 96 states, 95 states have (on average 6.894736842105263) internal successors, (655), 96 states have internal predecessors, (655), 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:28:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:28:07,603 INFO L93 Difference]: Finished difference Result 667 states and 714 transitions. [2025-01-10 01:28:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 01:28:07,604 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 6.894736842105263) internal successors, (655), 96 states have internal predecessors, (655), 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 328 [2025-01-10 01:28:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:28:07,606 INFO L225 Difference]: With dead ends: 667 [2025-01-10 01:28:07,606 INFO L226 Difference]: Without dead ends: 666 [2025-01-10 01:28:07,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 608 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:28:07,608 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:28:07,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 495 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:28:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-01-10 01:28:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2025-01-10 01:28:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 664 states have (on average 1.0030120481927711) internal successors, (666), 665 states have internal predecessors, (666), 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:28:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 666 transitions. [2025-01-10 01:28:07,621 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 666 transitions. Word has length 328 [2025-01-10 01:28:07,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:28:07,621 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 666 transitions. [2025-01-10 01:28:07,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 6.894736842105263) internal successors, (655), 96 states have internal predecessors, (655), 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:28:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 666 transitions. [2025-01-10 01:28:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-10 01:28:07,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:28:07,634 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 1, 1, 1] [2025-01-10 01:28:07,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:28:07,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 01:28:07,834 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:28:07,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:28:07,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1480347172, now seen corresponding path program 6 times [2025-01-10 01:28:07,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:28:07,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638591276] [2025-01-10 01:28:07,835 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:28:07,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:28:07,852 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 663 statements into 95 equivalence classes. [2025-01-10 01:28:07,967 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 663 of 663 statements. [2025-01-10 01:28:07,967 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:28:07,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:28:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 30879 backedges. 0 proven. 30879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:28:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:28:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638591276] [2025-01-10 01:28:12,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638591276] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:28:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420818285] [2025-01-10 01:28:12,812 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:28:12,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:28:12,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:28:12,814 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:28:12,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:28:12,848 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 663 statements into 95 equivalence classes. [2025-01-10 01:28:13,039 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 663 of 663 statements. [2025-01-10 01:28:13,039 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:28:13,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:28:13,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-10 01:28:13,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:28:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 30879 backedges. 0 proven. 30879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:28:13,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:28:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 30879 backedges. 0 proven. 30879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:28:20,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420818285] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:28:20,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:28:20,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-01-10 01:28:20,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187054860] [2025-01-10 01:28:20,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:28:20,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-01-10 01:28:20,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:28:20,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-01-10 01:28:20,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:28:20,877 INFO L87 Difference]: Start difference. First operand 666 states and 666 transitions. Second operand has 192 states, 191 states have (on average 6.93717277486911) internal successors, (1325), 192 states have internal predecessors, (1325), 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:28:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:28:22,622 INFO L93 Difference]: Finished difference Result 1433 states and 1528 transitions. [2025-01-10 01:28:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-01-10 01:28:22,623 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 6.93717277486911) internal successors, (1325), 192 states have internal predecessors, (1325), 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 663 [2025-01-10 01:28:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:28:22,627 INFO L225 Difference]: With dead ends: 1433 [2025-01-10 01:28:22,627 INFO L226 Difference]: Without dead ends: 1432 [2025-01-10 01:28:22,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1420 GetRequests, 1230 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:28:22,630 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 370 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:28:22,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1069 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:28:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-01-10 01:28:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1337. [2025-01-10 01:28:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 1335 states have (on average 1.0726591760299626) internal successors, (1432), 1336 states have internal predecessors, (1432), 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:28:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1432 transitions. [2025-01-10 01:28:22,657 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1432 transitions. Word has length 663 [2025-01-10 01:28:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:28:22,658 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1432 transitions. [2025-01-10 01:28:22,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 6.93717277486911) internal successors, (1325), 192 states have internal predecessors, (1325), 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:28:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1432 transitions. [2025-01-10 01:28:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-01-10 01:28:22,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:28:22,667 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 94, 94, 94, 94, 1, 1, 1] [2025-01-10 01:28:22,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:28:22,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:28:22,867 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:28:22,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:28:22,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1353877882, now seen corresponding path program 6 times [2025-01-10 01:28:22,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:28:22,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275875212] [2025-01-10 01:28:22,868 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:28:22,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:28:22,879 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 664 statements into 95 equivalence classes. [2025-01-10 01:28:22,971 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 664 of 664 statements. [2025-01-10 01:28:22,972 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:28:22,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:28:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30973 backedges. 0 proven. 30973 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:28:27,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:28:27,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275875212] [2025-01-10 01:28:27,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275875212] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:28:27,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285694524] [2025-01-10 01:28:27,768 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:28:27,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:28:27,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:28:27,769 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:28:27,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:28:27,809 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 664 statements into 95 equivalence classes. [2025-01-10 01:28:27,979 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 664 of 664 statements. [2025-01-10 01:28:27,980 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:28:27,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:28:27,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-10 01:28:27,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:28:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 30973 backedges. 0 proven. 30973 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:28:28,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:28:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 30973 backedges. 0 proven. 30973 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:28:36,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285694524] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:28:36,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:28:36,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-01-10 01:28:36,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758661488] [2025-01-10 01:28:36,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:28:36,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-01-10 01:28:36,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:28:36,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-01-10 01:28:36,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:28:36,122 INFO L87 Difference]: Start difference. First operand 1337 states and 1432 transitions. Second operand has 192 states, 191 states have (on average 6.947643979057592) internal successors, (1327), 192 states have internal predecessors, (1327), 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:28:37,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:28:37,268 INFO L93 Difference]: Finished difference Result 1339 states and 1434 transitions. [2025-01-10 01:28:37,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-01-10 01:28:37,269 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 6.947643979057592) internal successors, (1327), 192 states have internal predecessors, (1327), 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 664 [2025-01-10 01:28:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:28:37,273 INFO L225 Difference]: With dead ends: 1339 [2025-01-10 01:28:37,273 INFO L226 Difference]: Without dead ends: 1338 [2025-01-10 01:28:37,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1422 GetRequests, 1232 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:28:37,275 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:28:37,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 973 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:28:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-01-10 01:28:37,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1338. [2025-01-10 01:28:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 1336 states have (on average 1.001497005988024) internal successors, (1338), 1337 states have internal predecessors, (1338), 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:28:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1338 transitions. [2025-01-10 01:28:37,297 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1338 transitions. Word has length 664 [2025-01-10 01:28:37,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:28:37,298 INFO L471 AbstractCegarLoop]: Abstraction has 1338 states and 1338 transitions. [2025-01-10 01:28:37,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 6.947643979057592) internal successors, (1327), 192 states have internal predecessors, (1327), 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:28:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1338 transitions. [2025-01-10 01:28:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1336 [2025-01-10 01:28:37,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:28:37,308 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 190, 190, 190, 190, 190, 1, 1, 1] [2025-01-10 01:28:37,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:28:37,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:28:37,508 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:28:37,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:28:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1479634396, now seen corresponding path program 7 times [2025-01-10 01:28:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:28:37,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939905289] [2025-01-10 01:28:37,509 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:28:37,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:28:37,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1335 statements into 1 equivalence classes. [2025-01-10 01:28:37,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1335 of 1335 statements. [2025-01-10 01:28:37,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:28:37,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:29:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 126255 backedges. 0 proven. 126255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:29:00,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:29:00,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939905289] [2025-01-10 01:29:00,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939905289] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:29:00,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145437292] [2025-01-10 01:29:00,295 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:29:00,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:29:00,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:29:00,297 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:29:00,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:29:00,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1335 statements into 1 equivalence classes. [2025-01-10 01:29:00,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1335 of 1335 statements. [2025-01-10 01:29:00,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:29:00,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:29:00,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 2482 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-01-10 01:29:00,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:29:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 126255 backedges. 0 proven. 126255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:29:01,406 INFO L312 TraceCheckSpWp]: Computing backward predicates...