./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:38:49,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:38:49,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:38:49,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:38:49,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:38:49,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:38:49,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:38:49,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:38:49,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:38:49,963 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:38:49,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:38:49,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:38:49,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:38:49,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:38:49,964 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:38:49,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:38:49,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:38:49,965 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:38:49,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:38:49,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:38:49,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:38:49,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:38:49,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:38:49,966 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:38:49,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:38:49,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:38:49,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:38:49,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:38:49,967 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:38:49,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:38:49,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:38:49,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:38:49,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:38:49,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:38:49,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:38:49,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:38:49,967 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c [2025-01-10 02:38:50,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:38:50,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:38:50,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:38:50,261 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:38:50,261 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:38:50,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-10 02:38:51,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee3f276f1/0e6d55b46f1344d1a6b4e1b53e58b050/FLAG4cc706286 [2025-01-10 02:38:51,793 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:38:51,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-10 02:38:51,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee3f276f1/0e6d55b46f1344d1a6b4e1b53e58b050/FLAG4cc706286 [2025-01-10 02:38:51,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee3f276f1/0e6d55b46f1344d1a6b4e1b53e58b050 [2025-01-10 02:38:51,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:38:51,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:38:51,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:38:51,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:38:51,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:38:51,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:38:51" (1/1) ... [2025-01-10 02:38:51,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d8af91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:51, skipping insertion in model container [2025-01-10 02:38:51,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:38:51" (1/1) ... [2025-01-10 02:38:51,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:38:52,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:38:52,034 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:38:52,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:38:52,075 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:38:52,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52 WrapperNode [2025-01-10 02:38:52,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:38:52,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:38:52,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:38:52,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:38:52,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,117 INFO L138 Inliner]: procedures = 23, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 306 [2025-01-10 02:38:52,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:38:52,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:38:52,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:38:52,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:38:52,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,148 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 02:38:52,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:38:52,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:38:52,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:38:52,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:38:52,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (1/1) ... [2025-01-10 02:38:52,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:38:52,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:38:52,213 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 02:38:52,215 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 02:38:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:38:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:38:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:38:52,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:38:52,308 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:38:52,310 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:38:52,633 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-10 02:38:52,634 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:38:52,643 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:38:52,645 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:38:52,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:38:52 BoogieIcfgContainer [2025-01-10 02:38:52,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:38:52,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:38:52,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:38:52,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:38:52,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:38:51" (1/3) ... [2025-01-10 02:38:52,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddc7e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:38:52, skipping insertion in model container [2025-01-10 02:38:52,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:52" (2/3) ... [2025-01-10 02:38:52,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddc7e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:38:52, skipping insertion in model container [2025-01-10 02:38:52,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:38:52" (3/3) ... [2025-01-10 02:38:52,656 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-10 02:38:52,668 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:38:52,670 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 90 locations, 1 initial locations, 0 loop locations, and 14 error locations. [2025-01-10 02:38:52,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:38:52,730 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;@3fb405af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:38:52,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-10 02:38:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 75 states have (on average 1.7466666666666666) internal successors, (131), 89 states have internal predecessors, (131), 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 02:38:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 02:38:52,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:52,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:52,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:52,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1523334527, now seen corresponding path program 1 times [2025-01-10 02:38:52,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:52,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684293275] [2025-01-10 02:38:52,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:52,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:52,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 02:38:52,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 02:38:52,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:52,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:52,932 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 02:38:52,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:52,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684293275] [2025-01-10 02:38:52,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684293275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:52,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:52,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 02:38:52,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639986908] [2025-01-10 02:38:52,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:52,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:38:52,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:52,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:38:52,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:38:52,956 INFO L87 Difference]: Start difference. First operand has 90 states, 75 states have (on average 1.7466666666666666) internal successors, (131), 89 states have internal predecessors, (131), 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 2 states, 1 states have (on average 23.0) internal successors, (23), 2 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 02:38:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:52,969 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2025-01-10 02:38:52,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:38:52,970 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 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 23 [2025-01-10 02:38:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:52,976 INFO L225 Difference]: With dead ends: 93 [2025-01-10 02:38:52,977 INFO L226 Difference]: Without dead ends: 84 [2025-01-10 02:38:52,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:38:52,982 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:52,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-10 02:38:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-10 02:38:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.5) internal successors, (108), 83 states have internal predecessors, (108), 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 02:38:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2025-01-10 02:38:53,017 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 23 [2025-01-10 02:38:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:53,017 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2025-01-10 02:38:53,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 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 02:38:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2025-01-10 02:38:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 02:38:53,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:53,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:53,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:38:53,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:53,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:53,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1695954455, now seen corresponding path program 1 times [2025-01-10 02:38:53,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:53,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312955214] [2025-01-10 02:38:53,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:53,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:53,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 02:38:53,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 02:38:53,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:53,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:53,181 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 02:38:53,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:53,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312955214] [2025-01-10 02:38:53,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312955214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:53,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:53,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:53,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372450485] [2025-01-10 02:38:53,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:53,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:38:53,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:53,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:38:53,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:38:53,183 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 02:38:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:53,218 INFO L93 Difference]: Finished difference Result 206 states and 273 transitions. [2025-01-10 02:38:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:38:53,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 02:38:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:53,221 INFO L225 Difference]: With dead ends: 206 [2025-01-10 02:38:53,221 INFO L226 Difference]: Without dead ends: 141 [2025-01-10 02:38:53,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 02:38:53,224 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 74 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:53,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 248 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:53,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-10 02:38:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2025-01-10 02:38:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 117 states have (on average 1.564102564102564) internal successors, (183), 128 states have internal predecessors, (183), 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 02:38:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2025-01-10 02:38:53,237 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 34 [2025-01-10 02:38:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:53,238 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2025-01-10 02:38:53,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 02:38:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2025-01-10 02:38:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 02:38:53,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:53,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:53,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:38:53,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:53,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1943407502, now seen corresponding path program 1 times [2025-01-10 02:38:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:53,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220251796] [2025-01-10 02:38:53,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:53,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 02:38:53,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 02:38:53,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:53,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:53,360 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 02:38:53,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:53,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220251796] [2025-01-10 02:38:53,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220251796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:53,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:53,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:53,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642778986] [2025-01-10 02:38:53,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:53,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:38:53,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:53,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:38:53,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:38:53,361 INFO L87 Difference]: Start difference. First operand 129 states and 183 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:38:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:53,407 INFO L93 Difference]: Finished difference Result 333 states and 485 transitions. [2025-01-10 02:38:53,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:38:53,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-10 02:38:53,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:53,415 INFO L225 Difference]: With dead ends: 333 [2025-01-10 02:38:53,415 INFO L226 Difference]: Without dead ends: 223 [2025-01-10 02:38:53,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 02:38:53,415 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 69 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:53,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 244 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-01-10 02:38:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 211. [2025-01-10 02:38:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 199 states have (on average 1.6030150753768844) internal successors, (319), 210 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 02:38:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 319 transitions. [2025-01-10 02:38:53,447 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 319 transitions. Word has length 35 [2025-01-10 02:38:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:53,447 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 319 transitions. [2025-01-10 02:38:53,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:38:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 319 transitions. [2025-01-10 02:38:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 02:38:53,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:53,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:53,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:38:53,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:53,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:53,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2103371824, now seen corresponding path program 1 times [2025-01-10 02:38:53,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:53,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580470867] [2025-01-10 02:38:53,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:53,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:53,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:38:53,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:38:53,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:53,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:53,615 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 02:38:53,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:53,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580470867] [2025-01-10 02:38:53,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580470867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:53,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:53,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:53,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337670780] [2025-01-10 02:38:53,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:53,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:38:53,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:53,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:38:53,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:53,622 INFO L87 Difference]: Start difference. First operand 211 states and 319 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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 02:38:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:53,760 INFO L93 Difference]: Finished difference Result 400 states and 619 transitions. [2025-01-10 02:38:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:38:53,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-10 02:38:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:53,762 INFO L225 Difference]: With dead ends: 400 [2025-01-10 02:38:53,764 INFO L226 Difference]: Without dead ends: 397 [2025-01-10 02:38:53,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:53,765 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 252 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:53,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 142 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:53,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-01-10 02:38:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 391. [2025-01-10 02:38:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 379 states have (on average 1.6015831134564644) internal successors, (607), 390 states have internal predecessors, (607), 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 02:38:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 607 transitions. [2025-01-10 02:38:53,781 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 607 transitions. Word has length 36 [2025-01-10 02:38:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:53,781 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 607 transitions. [2025-01-10 02:38:53,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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 02:38:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 607 transitions. [2025-01-10 02:38:53,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 02:38:53,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:53,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:53,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:38:53,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:53,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash -780016968, now seen corresponding path program 1 times [2025-01-10 02:38:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198840225] [2025-01-10 02:38:53,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:53,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:38:53,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:38:53,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:53,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:53,885 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 02:38:53,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:53,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198840225] [2025-01-10 02:38:53,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198840225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:53,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:53,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:53,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629921174] [2025-01-10 02:38:53,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:53,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:38:53,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:53,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:38:53,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:53,888 INFO L87 Difference]: Start difference. First operand 391 states and 607 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 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 02:38:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:54,009 INFO L93 Difference]: Finished difference Result 769 states and 1183 transitions. [2025-01-10 02:38:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:54,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 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) Word has length 37 [2025-01-10 02:38:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:54,012 INFO L225 Difference]: With dead ends: 769 [2025-01-10 02:38:54,012 INFO L226 Difference]: Without dead ends: 766 [2025-01-10 02:38:54,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:54,015 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 242 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:54,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 254 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-01-10 02:38:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 571. [2025-01-10 02:38:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 559 states have (on average 1.5796064400715564) internal successors, (883), 570 states have internal predecessors, (883), 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 02:38:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 883 transitions. [2025-01-10 02:38:54,046 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 883 transitions. Word has length 37 [2025-01-10 02:38:54,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:54,046 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 883 transitions. [2025-01-10 02:38:54,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 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 02:38:54,047 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 883 transitions. [2025-01-10 02:38:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 02:38:54,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:54,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:54,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:38:54,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:54,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1589277906, now seen corresponding path program 1 times [2025-01-10 02:38:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649571920] [2025-01-10 02:38:54,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:54,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:54,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 02:38:54,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 02:38:54,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:54,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:54,138 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 02:38:54,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:54,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649571920] [2025-01-10 02:38:54,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649571920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:54,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:54,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:54,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379257325] [2025-01-10 02:38:54,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:54,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:54,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:54,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:54,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:54,139 INFO L87 Difference]: Start difference. First operand 571 states and 883 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:38:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:54,312 INFO L93 Difference]: Finished difference Result 946 states and 1471 transitions. [2025-01-10 02:38:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:38:54,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-10 02:38:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:54,318 INFO L225 Difference]: With dead ends: 946 [2025-01-10 02:38:54,318 INFO L226 Difference]: Without dead ends: 943 [2025-01-10 02:38:54,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:38:54,320 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 493 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:54,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 291 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-01-10 02:38:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 931. [2025-01-10 02:38:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 919 states have (on average 1.561479869423286) internal successors, (1435), 930 states have internal predecessors, (1435), 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 02:38:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1435 transitions. [2025-01-10 02:38:54,339 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1435 transitions. Word has length 38 [2025-01-10 02:38:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:54,339 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1435 transitions. [2025-01-10 02:38:54,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:38:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1435 transitions. [2025-01-10 02:38:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-10 02:38:54,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:54,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:54,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:38:54,340 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:54,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:54,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2022974970, now seen corresponding path program 1 times [2025-01-10 02:38:54,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:54,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798293366] [2025-01-10 02:38:54,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:54,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:54,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 02:38:54,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 02:38:54,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:54,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:54,422 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 02:38:54,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:54,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798293366] [2025-01-10 02:38:54,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798293366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:54,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:54,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423262973] [2025-01-10 02:38:54,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:54,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:54,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:54,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:54,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:54,423 INFO L87 Difference]: Start difference. First operand 931 states and 1435 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:38:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:54,644 INFO L93 Difference]: Finished difference Result 2944 states and 4519 transitions. [2025-01-10 02:38:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:38:54,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-10 02:38:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:54,650 INFO L225 Difference]: With dead ends: 2944 [2025-01-10 02:38:54,650 INFO L226 Difference]: Without dead ends: 2032 [2025-01-10 02:38:54,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:38:54,653 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 446 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:54,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 596 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:38:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2025-01-10 02:38:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1471. [2025-01-10 02:38:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1459 states have (on average 1.5099383139136395) internal successors, (2203), 1470 states have internal predecessors, (2203), 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 02:38:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2203 transitions. [2025-01-10 02:38:54,682 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2203 transitions. Word has length 39 [2025-01-10 02:38:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:54,682 INFO L471 AbstractCegarLoop]: Abstraction has 1471 states and 2203 transitions. [2025-01-10 02:38:54,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:38:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2203 transitions. [2025-01-10 02:38:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 02:38:54,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:54,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:54,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:38:54,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:54,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash 130408946, now seen corresponding path program 1 times [2025-01-10 02:38:54,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:54,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853280056] [2025-01-10 02:38:54,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:54,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:54,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 02:38:54,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 02:38:54,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:54,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:54,726 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 02:38:54,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:54,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853280056] [2025-01-10 02:38:54,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853280056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:54,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:54,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:54,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336349173] [2025-01-10 02:38:54,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:54,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:38:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:54,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:38:54,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:38:54,728 INFO L87 Difference]: Start difference. First operand 1471 states and 2203 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 02:38:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:54,751 INFO L93 Difference]: Finished difference Result 4023 states and 6027 transitions. [2025-01-10 02:38:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:38:54,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2025-01-10 02:38:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:54,757 INFO L225 Difference]: With dead ends: 4023 [2025-01-10 02:38:54,757 INFO L226 Difference]: Without dead ends: 2571 [2025-01-10 02:38:54,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 02:38:54,758 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 75 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:54,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 257 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2025-01-10 02:38:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2559. [2025-01-10 02:38:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2547 states have (on average 1.4962701217118177) internal successors, (3811), 2558 states have internal predecessors, (3811), 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 02:38:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 3811 transitions. [2025-01-10 02:38:54,799 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 3811 transitions. Word has length 40 [2025-01-10 02:38:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:54,799 INFO L471 AbstractCegarLoop]: Abstraction has 2559 states and 3811 transitions. [2025-01-10 02:38:54,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 02:38:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 3811 transitions. [2025-01-10 02:38:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 02:38:54,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:54,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:54,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:38:54,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:54,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1882770870, now seen corresponding path program 1 times [2025-01-10 02:38:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:54,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428253980] [2025-01-10 02:38:54,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:54,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 02:38:54,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 02:38:54,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:54,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:54,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:54,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428253980] [2025-01-10 02:38:54,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428253980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:54,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:54,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:54,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052429873] [2025-01-10 02:38:54,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:54,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:38:54,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:54,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:38:54,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:38:54,869 INFO L87 Difference]: Start difference. First operand 2559 states and 3811 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 02:38:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:54,941 INFO L93 Difference]: Finished difference Result 5815 states and 8629 transitions. [2025-01-10 02:38:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:38:54,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2025-01-10 02:38:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:54,951 INFO L225 Difference]: With dead ends: 5815 [2025-01-10 02:38:54,951 INFO L226 Difference]: Without dead ends: 3275 [2025-01-10 02:38:54,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 02:38:54,956 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 45 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:54,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 186 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:54,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2025-01-10 02:38:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3229. [2025-01-10 02:38:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 3217 states have (on average 1.4762200808206403) internal successors, (4749), 3228 states have internal predecessors, (4749), 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 02:38:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4749 transitions. [2025-01-10 02:38:55,012 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4749 transitions. Word has length 62 [2025-01-10 02:38:55,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:55,012 INFO L471 AbstractCegarLoop]: Abstraction has 3229 states and 4749 transitions. [2025-01-10 02:38:55,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 02:38:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4749 transitions. [2025-01-10 02:38:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 02:38:55,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:55,013 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:55,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:38:55,014 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:55,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash -572370161, now seen corresponding path program 1 times [2025-01-10 02:38:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:55,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145250571] [2025-01-10 02:38:55,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:55,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 02:38:55,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 02:38:55,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:55,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:55,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:55,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145250571] [2025-01-10 02:38:55,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145250571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:55,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:55,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:38:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760186353] [2025-01-10 02:38:55,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:55,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:55,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:55,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:55,173 INFO L87 Difference]: Start difference. First operand 3229 states and 4749 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 02:38:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:55,289 INFO L93 Difference]: Finished difference Result 6443 states and 9477 transitions. [2025-01-10 02:38:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:55,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2025-01-10 02:38:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:55,297 INFO L225 Difference]: With dead ends: 6443 [2025-01-10 02:38:55,297 INFO L226 Difference]: Without dead ends: 3235 [2025-01-10 02:38:55,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:38:55,302 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 106 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:55,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 217 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:55,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2025-01-10 02:38:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3229. [2025-01-10 02:38:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 3217 states have (on average 1.4662729250854833) internal successors, (4717), 3228 states have internal predecessors, (4717), 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 02:38:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4717 transitions. [2025-01-10 02:38:55,410 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4717 transitions. Word has length 66 [2025-01-10 02:38:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:55,411 INFO L471 AbstractCegarLoop]: Abstraction has 3229 states and 4717 transitions. [2025-01-10 02:38:55,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 02:38:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4717 transitions. [2025-01-10 02:38:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 02:38:55,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:55,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:55,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:38:55,412 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:55,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1347932395, now seen corresponding path program 1 times [2025-01-10 02:38:55,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:55,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573221238] [2025-01-10 02:38:55,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:55,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:55,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 02:38:55,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 02:38:55,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:55,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:38:55,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:55,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573221238] [2025-01-10 02:38:55,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573221238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:55,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:55,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:55,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88453490] [2025-01-10 02:38:55,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:55,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:38:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:55,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:38:55,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:55,491 INFO L87 Difference]: Start difference. First operand 3229 states and 4717 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:38:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:55,571 INFO L93 Difference]: Finished difference Result 4189 states and 6133 transitions. [2025-01-10 02:38:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:38:55,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-10 02:38:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:55,582 INFO L225 Difference]: With dead ends: 4189 [2025-01-10 02:38:55,582 INFO L226 Difference]: Without dead ends: 4186 [2025-01-10 02:38:55,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:55,584 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 128 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:55,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 277 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2025-01-10 02:38:55,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 3277. [2025-01-10 02:38:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3277 states, 3265 states have (on average 1.475344563552833) internal successors, (4817), 3276 states have internal predecessors, (4817), 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 02:38:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 4817 transitions. [2025-01-10 02:38:55,635 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 4817 transitions. Word has length 67 [2025-01-10 02:38:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:55,635 INFO L471 AbstractCegarLoop]: Abstraction has 3277 states and 4817 transitions. [2025-01-10 02:38:55,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:38:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 4817 transitions. [2025-01-10 02:38:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 02:38:55,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:55,636 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:55,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 02:38:55,638 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:55,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:55,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1163768577, now seen corresponding path program 1 times [2025-01-10 02:38:55,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:55,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210904411] [2025-01-10 02:38:55,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:55,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:55,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 02:38:55,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 02:38:55,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:55,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:38:55,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:55,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210904411] [2025-01-10 02:38:55,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210904411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:55,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:55,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274165933] [2025-01-10 02:38:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:55,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:55,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:55,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:55,740 INFO L87 Difference]: Start difference. First operand 3277 states and 4817 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 02:38:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:55,858 INFO L93 Difference]: Finished difference Result 9211 states and 13637 transitions. [2025-01-10 02:38:55,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:55,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-10 02:38:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:55,873 INFO L225 Difference]: With dead ends: 9211 [2025-01-10 02:38:55,874 INFO L226 Difference]: Without dead ends: 5955 [2025-01-10 02:38:55,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:38:55,878 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 305 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:55,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 268 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2025-01-10 02:38:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 5173. [2025-01-10 02:38:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5173 states, 5161 states have (on average 1.4813020732416198) internal successors, (7645), 5172 states have internal predecessors, (7645), 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 02:38:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 7645 transitions. [2025-01-10 02:38:55,950 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 7645 transitions. Word has length 68 [2025-01-10 02:38:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:55,950 INFO L471 AbstractCegarLoop]: Abstraction has 5173 states and 7645 transitions. [2025-01-10 02:38:55,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 02:38:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 7645 transitions. [2025-01-10 02:38:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 02:38:55,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:55,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:55,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 02:38:55,952 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:55,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:55,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1651039598, now seen corresponding path program 1 times [2025-01-10 02:38:55,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:55,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292369610] [2025-01-10 02:38:55,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:55,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 02:38:55,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 02:38:55,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:55,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:38:56,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:56,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292369610] [2025-01-10 02:38:56,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292369610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:56,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:56,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:56,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548869739] [2025-01-10 02:38:56,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:56,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:38:56,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:56,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:38:56,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:56,025 INFO L87 Difference]: Start difference. First operand 5173 states and 7645 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 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 02:38:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:56,092 INFO L93 Difference]: Finished difference Result 5176 states and 7645 transitions. [2025-01-10 02:38:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:38:56,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 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 68 [2025-01-10 02:38:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:56,114 INFO L225 Difference]: With dead ends: 5176 [2025-01-10 02:38:56,114 INFO L226 Difference]: Without dead ends: 5173 [2025-01-10 02:38:56,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:56,116 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 116 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:56,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 214 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2025-01-10 02:38:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 5170. [2025-01-10 02:38:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5170 states, 5161 states have (on average 1.4534005037783375) internal successors, (7501), 5169 states have internal predecessors, (7501), 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 02:38:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 7501 transitions. [2025-01-10 02:38:56,224 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 7501 transitions. Word has length 68 [2025-01-10 02:38:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:56,224 INFO L471 AbstractCegarLoop]: Abstraction has 5170 states and 7501 transitions. [2025-01-10 02:38:56,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 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 02:38:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 7501 transitions. [2025-01-10 02:38:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 02:38:56,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:56,225 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:56,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 02:38:56,225 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:56,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:56,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1717087379, now seen corresponding path program 1 times [2025-01-10 02:38:56,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:56,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927279703] [2025-01-10 02:38:56,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:56,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 02:38:56,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 02:38:56,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:56,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:38:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:56,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927279703] [2025-01-10 02:38:56,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927279703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:56,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:56,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:56,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960770433] [2025-01-10 02:38:56,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:56,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:56,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:56,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:56,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:56,325 INFO L87 Difference]: Start difference. First operand 5170 states and 7501 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:38:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:56,540 INFO L93 Difference]: Finished difference Result 10322 states and 14969 transitions. [2025-01-10 02:38:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:56,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-10 02:38:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:56,553 INFO L225 Difference]: With dead ends: 10322 [2025-01-10 02:38:56,554 INFO L226 Difference]: Without dead ends: 6073 [2025-01-10 02:38:56,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:38:56,558 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 261 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:56,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 380 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:38:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2025-01-10 02:38:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 6070. [2025-01-10 02:38:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6070 states, 6061 states have (on average 1.4296320739151955) internal successors, (8665), 6069 states have internal predecessors, (8665), 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 02:38:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6070 states to 6070 states and 8665 transitions. [2025-01-10 02:38:56,622 INFO L78 Accepts]: Start accepts. Automaton has 6070 states and 8665 transitions. Word has length 69 [2025-01-10 02:38:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:56,622 INFO L471 AbstractCegarLoop]: Abstraction has 6070 states and 8665 transitions. [2025-01-10 02:38:56,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:38:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6070 states and 8665 transitions. [2025-01-10 02:38:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 02:38:56,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:56,623 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:56,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:38:56,623 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:56,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1070854285, now seen corresponding path program 1 times [2025-01-10 02:38:56,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:56,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84157189] [2025-01-10 02:38:56,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:56,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:56,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 02:38:56,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 02:38:56,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:56,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 02:38:56,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:56,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84157189] [2025-01-10 02:38:56,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84157189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:56,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:56,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:56,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522603115] [2025-01-10 02:38:56,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:56,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:56,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:56,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:56,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:56,708 INFO L87 Difference]: Start difference. First operand 6070 states and 8665 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 02:38:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:56,878 INFO L93 Difference]: Finished difference Result 11222 states and 16145 transitions. [2025-01-10 02:38:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:56,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 69 [2025-01-10 02:38:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:56,887 INFO L225 Difference]: With dead ends: 11222 [2025-01-10 02:38:56,887 INFO L226 Difference]: Without dead ends: 6073 [2025-01-10 02:38:56,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:38:56,892 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 267 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:56,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 352 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2025-01-10 02:38:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 6070. [2025-01-10 02:38:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6070 states, 6061 states have (on average 1.422372545784524) internal successors, (8621), 6069 states have internal predecessors, (8621), 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 02:38:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6070 states to 6070 states and 8621 transitions. [2025-01-10 02:38:56,988 INFO L78 Accepts]: Start accepts. Automaton has 6070 states and 8621 transitions. Word has length 69 [2025-01-10 02:38:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:56,989 INFO L471 AbstractCegarLoop]: Abstraction has 6070 states and 8621 transitions. [2025-01-10 02:38:56,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 02:38:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6070 states and 8621 transitions. [2025-01-10 02:38:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 02:38:56,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:56,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:56,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:38:56,990 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:56,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash 357380150, now seen corresponding path program 1 times [2025-01-10 02:38:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613815113] [2025-01-10 02:38:56,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:56,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:57,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 02:38:57,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 02:38:57,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:57,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:38:57,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:57,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613815113] [2025-01-10 02:38:57,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613815113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:57,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:57,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:57,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888338221] [2025-01-10 02:38:57,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:57,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:38:57,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:57,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:38:57,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:57,058 INFO L87 Difference]: Start difference. First operand 6070 states and 8621 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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 02:38:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:57,136 INFO L93 Difference]: Finished difference Result 7975 states and 11453 transitions. [2025-01-10 02:38:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:38:57,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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 69 [2025-01-10 02:38:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:57,146 INFO L225 Difference]: With dead ends: 7975 [2025-01-10 02:38:57,147 INFO L226 Difference]: Without dead ends: 7972 [2025-01-10 02:38:57,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:57,149 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 117 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:57,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 274 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7972 states. [2025-01-10 02:38:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7972 to 7966. [2025-01-10 02:38:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7966 states, 7957 states have (on average 1.4212642955887898) internal successors, (11309), 7965 states have internal predecessors, (11309), 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 02:38:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7966 states to 7966 states and 11309 transitions. [2025-01-10 02:38:57,220 INFO L78 Accepts]: Start accepts. Automaton has 7966 states and 11309 transitions. Word has length 69 [2025-01-10 02:38:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:57,221 INFO L471 AbstractCegarLoop]: Abstraction has 7966 states and 11309 transitions. [2025-01-10 02:38:57,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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 02:38:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 7966 states and 11309 transitions. [2025-01-10 02:38:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 02:38:57,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:57,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:57,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 02:38:57,222 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:57,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:57,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1806117100, now seen corresponding path program 1 times [2025-01-10 02:38:57,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:57,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068304928] [2025-01-10 02:38:57,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:57,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:38:57,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:38:57,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:57,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:38:57,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:57,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068304928] [2025-01-10 02:38:57,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068304928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:57,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:57,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:57,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499489694] [2025-01-10 02:38:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:57,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:57,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:57,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:57,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:57,294 INFO L87 Difference]: Start difference. First operand 7966 states and 11309 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 02:38:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:57,425 INFO L93 Difference]: Finished difference Result 15074 states and 21881 transitions. [2025-01-10 02:38:57,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:57,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 70 [2025-01-10 02:38:57,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:57,440 INFO L225 Difference]: With dead ends: 15074 [2025-01-10 02:38:57,440 INFO L226 Difference]: Without dead ends: 9377 [2025-01-10 02:38:57,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:38:57,447 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 284 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:57,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 279 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2025-01-10 02:38:57,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 7782. [2025-01-10 02:38:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7782 states, 7773 states have (on average 1.4266049144474462) internal successors, (11089), 7781 states have internal predecessors, (11089), 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 02:38:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7782 states to 7782 states and 11089 transitions. [2025-01-10 02:38:57,554 INFO L78 Accepts]: Start accepts. Automaton has 7782 states and 11089 transitions. Word has length 70 [2025-01-10 02:38:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:57,555 INFO L471 AbstractCegarLoop]: Abstraction has 7782 states and 11089 transitions. [2025-01-10 02:38:57,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 02:38:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 7782 states and 11089 transitions. [2025-01-10 02:38:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 02:38:57,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:57,556 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:57,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 02:38:57,556 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:57,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash 536801861, now seen corresponding path program 1 times [2025-01-10 02:38:57,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:57,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336060641] [2025-01-10 02:38:57,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:57,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:57,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 02:38:57,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 02:38:57,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:57,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:38:57,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:57,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336060641] [2025-01-10 02:38:57,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336060641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:57,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:57,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:57,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244138166] [2025-01-10 02:38:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:57,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:57,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:57,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:57,659 INFO L87 Difference]: Start difference. First operand 7782 states and 11089 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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 02:38:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:57,770 INFO L93 Difference]: Finished difference Result 8236 states and 11717 transitions. [2025-01-10 02:38:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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 71 [2025-01-10 02:38:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:57,782 INFO L225 Difference]: With dead ends: 8236 [2025-01-10 02:38:57,783 INFO L226 Difference]: Without dead ends: 8233 [2025-01-10 02:38:57,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:57,786 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 216 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:57,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 359 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8233 states. [2025-01-10 02:38:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8233 to 8230. [2025-01-10 02:38:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8230 states, 8221 states have (on average 1.4174674613793943) internal successors, (11653), 8229 states have internal predecessors, (11653), 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 02:38:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8230 states to 8230 states and 11653 transitions. [2025-01-10 02:38:57,878 INFO L78 Accepts]: Start accepts. Automaton has 8230 states and 11653 transitions. Word has length 71 [2025-01-10 02:38:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:57,878 INFO L471 AbstractCegarLoop]: Abstraction has 8230 states and 11653 transitions. [2025-01-10 02:38:57,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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 02:38:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 8230 states and 11653 transitions. [2025-01-10 02:38:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 02:38:57,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:57,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:57,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 02:38:57,879 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:57,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:57,880 INFO L85 PathProgramCache]: Analyzing trace with hash -471598904, now seen corresponding path program 1 times [2025-01-10 02:38:57,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:57,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461943085] [2025-01-10 02:38:57,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:57,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:57,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 02:38:57,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 02:38:57,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:57,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:38:57,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:57,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461943085] [2025-01-10 02:38:57,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461943085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:57,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:57,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:57,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014193915] [2025-01-10 02:38:57,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:57,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:38:57,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:57,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:38:57,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:57,952 INFO L87 Difference]: Start difference. First operand 8230 states and 11653 transitions. Second operand has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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 02:38:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:58,044 INFO L93 Difference]: Finished difference Result 10770 states and 15429 transitions. [2025-01-10 02:38:58,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:38:58,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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 71 [2025-01-10 02:38:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:58,059 INFO L225 Difference]: With dead ends: 10770 [2025-01-10 02:38:58,059 INFO L226 Difference]: Without dead ends: 10767 [2025-01-10 02:38:58,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:58,062 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 157 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:58,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 343 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10767 states. [2025-01-10 02:38:58,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10767 to 10126. [2025-01-10 02:38:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10126 states, 10117 states have (on average 1.4032816052189385) internal successors, (14197), 10125 states have internal predecessors, (14197), 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 02:38:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10126 states to 10126 states and 14197 transitions. [2025-01-10 02:38:58,136 INFO L78 Accepts]: Start accepts. Automaton has 10126 states and 14197 transitions. Word has length 71 [2025-01-10 02:38:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:58,136 INFO L471 AbstractCegarLoop]: Abstraction has 10126 states and 14197 transitions. [2025-01-10 02:38:58,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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 02:38:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 10126 states and 14197 transitions. [2025-01-10 02:38:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 02:38:58,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:58,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:58,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 02:38:58,137 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:58,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash -155055112, now seen corresponding path program 1 times [2025-01-10 02:38:58,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:58,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370999101] [2025-01-10 02:38:58,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:58,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:58,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 02:38:58,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 02:38:58,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:58,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:38:58,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370999101] [2025-01-10 02:38:58,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370999101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:58,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:58,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163749504] [2025-01-10 02:38:58,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:58,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:58,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:58,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:58,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:58,204 INFO L87 Difference]: Start difference. First operand 10126 states and 14197 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 02:38:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:58,360 INFO L93 Difference]: Finished difference Result 15507 states and 21781 transitions. [2025-01-10 02:38:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:58,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 71 [2025-01-10 02:38:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:58,376 INFO L225 Difference]: With dead ends: 15507 [2025-01-10 02:38:58,376 INFO L226 Difference]: Without dead ends: 11077 [2025-01-10 02:38:58,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:38:58,381 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 255 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:58,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 391 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11077 states. [2025-01-10 02:38:58,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11077 to 10442. [2025-01-10 02:38:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10442 states, 10433 states have (on average 1.400651778012077) internal successors, (14613), 10441 states have internal predecessors, (14613), 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 02:38:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10442 states to 10442 states and 14613 transitions. [2025-01-10 02:38:58,451 INFO L78 Accepts]: Start accepts. Automaton has 10442 states and 14613 transitions. Word has length 71 [2025-01-10 02:38:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:58,451 INFO L471 AbstractCegarLoop]: Abstraction has 10442 states and 14613 transitions. [2025-01-10 02:38:58,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 02:38:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 10442 states and 14613 transitions. [2025-01-10 02:38:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 02:38:58,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:58,452 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:58,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 02:38:58,452 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:58,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:58,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1734663998, now seen corresponding path program 1 times [2025-01-10 02:38:58,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:58,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259169375] [2025-01-10 02:38:58,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:58,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:58,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 02:38:58,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 02:38:58,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:58,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:38:58,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:58,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259169375] [2025-01-10 02:38:58,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259169375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:58,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:58,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:58,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636980361] [2025-01-10 02:38:58,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:58,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:58,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:58,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:58,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:58,522 INFO L87 Difference]: Start difference. First operand 10442 states and 14613 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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 02:38:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:58,606 INFO L93 Difference]: Finished difference Result 12780 states and 17921 transitions. [2025-01-10 02:38:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:58,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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 72 [2025-01-10 02:38:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:58,617 INFO L225 Difference]: With dead ends: 12780 [2025-01-10 02:38:58,617 INFO L226 Difference]: Without dead ends: 8350 [2025-01-10 02:38:58,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:58,621 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 194 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:58,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 316 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8350 states. [2025-01-10 02:38:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8350 to 6238. [2025-01-10 02:38:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6238 states, 6229 states have (on average 1.3891475357200194) internal successors, (8653), 6237 states have internal predecessors, (8653), 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 02:38:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6238 states to 6238 states and 8653 transitions. [2025-01-10 02:38:58,658 INFO L78 Accepts]: Start accepts. Automaton has 6238 states and 8653 transitions. Word has length 72 [2025-01-10 02:38:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:58,659 INFO L471 AbstractCegarLoop]: Abstraction has 6238 states and 8653 transitions. [2025-01-10 02:38:58,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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 02:38:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 6238 states and 8653 transitions. [2025-01-10 02:38:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 02:38:58,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:58,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:58,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 02:38:58,660 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:58,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2059991050, now seen corresponding path program 1 times [2025-01-10 02:38:58,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:58,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385306426] [2025-01-10 02:38:58,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:58,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 02:38:58,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 02:38:58,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:58,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:38:58,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:58,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385306426] [2025-01-10 02:38:58,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385306426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:58,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:58,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:58,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634886092] [2025-01-10 02:38:58,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:58,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:58,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:58,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:58,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:58,727 INFO L87 Difference]: Start difference. First operand 6238 states and 8653 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 02:38:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:58,810 INFO L93 Difference]: Finished difference Result 7416 states and 10373 transitions. [2025-01-10 02:38:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:58,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 73 [2025-01-10 02:38:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:58,819 INFO L225 Difference]: With dead ends: 7416 [2025-01-10 02:38:58,819 INFO L226 Difference]: Without dead ends: 7415 [2025-01-10 02:38:58,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:58,822 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 198 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:58,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 380 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2025-01-10 02:38:58,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 7406. [2025-01-10 02:38:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7406 states, 7397 states have (on average 1.4012437474651886) internal successors, (10365), 7405 states have internal predecessors, (10365), 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 02:38:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7406 states to 7406 states and 10365 transitions. [2025-01-10 02:38:58,875 INFO L78 Accepts]: Start accepts. Automaton has 7406 states and 10365 transitions. Word has length 73 [2025-01-10 02:38:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:58,875 INFO L471 AbstractCegarLoop]: Abstraction has 7406 states and 10365 transitions. [2025-01-10 02:38:58,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 02:38:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 7406 states and 10365 transitions. [2025-01-10 02:38:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 02:38:58,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:58,876 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:58,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 02:38:58,877 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:58,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:58,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1588743152, now seen corresponding path program 1 times [2025-01-10 02:38:58,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:58,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147964380] [2025-01-10 02:38:58,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:58,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:58,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 02:38:58,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 02:38:58,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:58,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:38:58,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:58,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147964380] [2025-01-10 02:38:58,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147964380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:58,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:58,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:58,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154715712] [2025-01-10 02:38:58,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:58,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:58,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:58,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:58,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:58,981 INFO L87 Difference]: Start difference. First operand 7406 states and 10365 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 02:38:59,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:59,078 INFO L93 Difference]: Finished difference Result 7728 states and 10813 transitions. [2025-01-10 02:38:59,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:59,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 73 [2025-01-10 02:38:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:59,090 INFO L225 Difference]: With dead ends: 7728 [2025-01-10 02:38:59,090 INFO L226 Difference]: Without dead ends: 7725 [2025-01-10 02:38:59,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:59,093 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 191 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:59,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 382 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7725 states. [2025-01-10 02:38:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7725 to 7722. [2025-01-10 02:38:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7722 states, 7713 states have (on average 1.3988072086088421) internal successors, (10789), 7721 states have internal predecessors, (10789), 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 02:38:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7722 states to 7722 states and 10789 transitions. [2025-01-10 02:38:59,154 INFO L78 Accepts]: Start accepts. Automaton has 7722 states and 10789 transitions. Word has length 73 [2025-01-10 02:38:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:59,154 INFO L471 AbstractCegarLoop]: Abstraction has 7722 states and 10789 transitions. [2025-01-10 02:38:59,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 02:38:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 7722 states and 10789 transitions. [2025-01-10 02:38:59,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 02:38:59,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:59,155 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:59,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 02:38:59,155 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:59,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:59,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1061807010, now seen corresponding path program 1 times [2025-01-10 02:38:59,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:59,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427655129] [2025-01-10 02:38:59,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:59,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:59,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 02:38:59,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 02:38:59,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:59,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:38:59,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:59,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427655129] [2025-01-10 02:38:59,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427655129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:59,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:59,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:59,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792392403] [2025-01-10 02:38:59,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:59,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:59,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:59,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:59,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:59,231 INFO L87 Difference]: Start difference. First operand 7722 states and 10789 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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 02:38:59,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:59,320 INFO L93 Difference]: Finished difference Result 7947 states and 11093 transitions. [2025-01-10 02:38:59,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:59,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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 02:38:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:59,331 INFO L225 Difference]: With dead ends: 7947 [2025-01-10 02:38:59,332 INFO L226 Difference]: Without dead ends: 7506 [2025-01-10 02:38:59,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:59,334 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 195 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:59,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 482 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7506 states. [2025-01-10 02:38:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7506 to 7502. [2025-01-10 02:38:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7502 states, 7493 states have (on average 1.3977045242226078) internal successors, (10473), 7501 states have internal predecessors, (10473), 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 02:38:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7502 states to 7502 states and 10473 transitions. [2025-01-10 02:38:59,384 INFO L78 Accepts]: Start accepts. Automaton has 7502 states and 10473 transitions. Word has length 75 [2025-01-10 02:38:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:59,384 INFO L471 AbstractCegarLoop]: Abstraction has 7502 states and 10473 transitions. [2025-01-10 02:38:59,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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 02:38:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand 7502 states and 10473 transitions. [2025-01-10 02:38:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 02:38:59,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:59,387 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:59,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 02:38:59,387 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:59,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1763683459, now seen corresponding path program 1 times [2025-01-10 02:38:59,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:59,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724433935] [2025-01-10 02:38:59,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:59,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:59,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 02:38:59,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 02:38:59,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:59,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:38:59,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:59,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724433935] [2025-01-10 02:38:59,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724433935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:59,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:59,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:59,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904069114] [2025-01-10 02:38:59,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:59,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:38:59,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:59,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:38:59,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:59,448 INFO L87 Difference]: Start difference. First operand 7502 states and 10473 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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 02:38:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:59,521 INFO L93 Difference]: Finished difference Result 7728 states and 10773 transitions. [2025-01-10 02:38:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:38:59,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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 96 [2025-01-10 02:38:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:59,530 INFO L225 Difference]: With dead ends: 7728 [2025-01-10 02:38:59,530 INFO L226 Difference]: Without dead ends: 7725 [2025-01-10 02:38:59,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:59,532 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 130 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:59,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 343 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7725 states. [2025-01-10 02:38:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7725 to 7499. [2025-01-10 02:38:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7499 states, 7493 states have (on average 1.365674629654344) internal successors, (10233), 7498 states have internal predecessors, (10233), 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 02:38:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7499 states to 7499 states and 10233 transitions. [2025-01-10 02:38:59,581 INFO L78 Accepts]: Start accepts. Automaton has 7499 states and 10233 transitions. Word has length 96 [2025-01-10 02:38:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:59,581 INFO L471 AbstractCegarLoop]: Abstraction has 7499 states and 10233 transitions. [2025-01-10 02:38:59,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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 02:38:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7499 states and 10233 transitions. [2025-01-10 02:38:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 02:38:59,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:59,584 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:59,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 02:38:59,584 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:59,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1612282239, now seen corresponding path program 1 times [2025-01-10 02:38:59,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:59,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862497250] [2025-01-10 02:38:59,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:59,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:59,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 02:38:59,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 02:38:59,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:59,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:38:59,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:59,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862497250] [2025-01-10 02:38:59,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862497250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:59,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:59,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:59,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764463026] [2025-01-10 02:38:59,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:59,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:59,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:59,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:59,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:59,683 INFO L87 Difference]: Start difference. First operand 7499 states and 10233 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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 02:38:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:59,781 INFO L93 Difference]: Finished difference Result 10834 states and 14909 transitions. [2025-01-10 02:38:59,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:59,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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 98 [2025-01-10 02:38:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:59,790 INFO L225 Difference]: With dead ends: 10834 [2025-01-10 02:38:59,790 INFO L226 Difference]: Without dead ends: 6516 [2025-01-10 02:38:59,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:59,795 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 208 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:59,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 417 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6516 states. [2025-01-10 02:38:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6516 to 6507. [2025-01-10 02:38:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6507 states, 6501 states have (on average 1.3636363636363635) internal successors, (8865), 6506 states have internal predecessors, (8865), 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 02:38:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6507 states to 6507 states and 8865 transitions. [2025-01-10 02:38:59,842 INFO L78 Accepts]: Start accepts. Automaton has 6507 states and 8865 transitions. Word has length 98 [2025-01-10 02:38:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:59,842 INFO L471 AbstractCegarLoop]: Abstraction has 6507 states and 8865 transitions. [2025-01-10 02:38:59,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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 02:38:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 6507 states and 8865 transitions. [2025-01-10 02:38:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 02:38:59,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:59,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:59,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 02:38:59,844 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:59,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:59,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1406860725, now seen corresponding path program 2 times [2025-01-10 02:38:59,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:59,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232452] [2025-01-10 02:38:59,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:38:59,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:59,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 98 statements into 2 equivalence classes. [2025-01-10 02:38:59,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 98 statements. [2025-01-10 02:38:59,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:38:59,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 02:38:59,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232452] [2025-01-10 02:38:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:59,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:59,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345469677] [2025-01-10 02:38:59,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:59,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:59,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:59,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:59,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:59,889 INFO L87 Difference]: Start difference. First operand 6507 states and 8865 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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 02:38:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:59,942 INFO L93 Difference]: Finished difference Result 12993 states and 17709 transitions. [2025-01-10 02:38:59,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:59,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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 98 [2025-01-10 02:38:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:59,950 INFO L225 Difference]: With dead ends: 12993 [2025-01-10 02:38:59,950 INFO L226 Difference]: Without dead ends: 6507 [2025-01-10 02:38:59,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:38:59,955 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 211 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:59,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 89 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6507 states. [2025-01-10 02:38:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6507 to 6507. [2025-01-10 02:38:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6507 states, 6501 states have (on average 1.3504076295954468) internal successors, (8779), 6506 states have internal predecessors, (8779), 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 02:38:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6507 states to 6507 states and 8779 transitions. [2025-01-10 02:38:59,996 INFO L78 Accepts]: Start accepts. Automaton has 6507 states and 8779 transitions. Word has length 98 [2025-01-10 02:38:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:59,996 INFO L471 AbstractCegarLoop]: Abstraction has 6507 states and 8779 transitions. [2025-01-10 02:38:59,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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 02:38:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 6507 states and 8779 transitions. [2025-01-10 02:38:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 02:38:59,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:59,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:59,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 02:38:59,999 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:38:59,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:59,999 INFO L85 PathProgramCache]: Analyzing trace with hash 161820459, now seen corresponding path program 1 times [2025-01-10 02:39:00,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:00,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913730469] [2025-01-10 02:39:00,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:00,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:00,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 02:39:00,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 02:39:00,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:00,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:39:00,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913730469] [2025-01-10 02:39:00,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913730469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:00,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:00,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954727261] [2025-01-10 02:39:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:00,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:00,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:00,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:00,090 INFO L87 Difference]: Start difference. First operand 6507 states and 8779 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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 02:39:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:00,188 INFO L93 Difference]: Finished difference Result 6737 states and 9075 transitions. [2025-01-10 02:39:00,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:00,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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 98 [2025-01-10 02:39:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:00,194 INFO L225 Difference]: With dead ends: 6737 [2025-01-10 02:39:00,194 INFO L226 Difference]: Without dead ends: 5664 [2025-01-10 02:39:00,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:00,196 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 187 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:00,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 481 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2025-01-10 02:39:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5655. [2025-01-10 02:39:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5655 states, 5649 states have (on average 1.3522747388918392) internal successors, (7639), 5654 states have internal predecessors, (7639), 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 02:39:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5655 states to 5655 states and 7639 transitions. [2025-01-10 02:39:00,231 INFO L78 Accepts]: Start accepts. Automaton has 5655 states and 7639 transitions. Word has length 98 [2025-01-10 02:39:00,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:00,232 INFO L471 AbstractCegarLoop]: Abstraction has 5655 states and 7639 transitions. [2025-01-10 02:39:00,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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 02:39:00,232 INFO L276 IsEmpty]: Start isEmpty. Operand 5655 states and 7639 transitions. [2025-01-10 02:39:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 02:39:00,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:00,256 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:00,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 02:39:00,256 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:39:00,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:00,256 INFO L85 PathProgramCache]: Analyzing trace with hash 952182435, now seen corresponding path program 1 times [2025-01-10 02:39:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229553993] [2025-01-10 02:39:00,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:00,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 02:39:00,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 02:39:00,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:00,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:39:00,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:00,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229553993] [2025-01-10 02:39:00,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229553993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:00,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:00,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:39:00,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799848576] [2025-01-10 02:39:00,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:00,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:39:00,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:00,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:39:00,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:39:00,296 INFO L87 Difference]: Start difference. First operand 5655 states and 7639 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:39:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:00,329 INFO L93 Difference]: Finished difference Result 12819 states and 17371 transitions. [2025-01-10 02:39:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:39:00,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-10 02:39:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:00,336 INFO L225 Difference]: With dead ends: 12819 [2025-01-10 02:39:00,336 INFO L226 Difference]: Without dead ends: 7853 [2025-01-10 02:39:00,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 02:39:00,341 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 62 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:00,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 235 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7853 states. [2025-01-10 02:39:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7853 to 7555. [2025-01-10 02:39:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7549 states have (on average 1.328255398065969) internal successors, (10027), 7554 states have internal predecessors, (10027), 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 02:39:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10027 transitions. [2025-01-10 02:39:00,430 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10027 transitions. Word has length 98 [2025-01-10 02:39:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:00,430 INFO L471 AbstractCegarLoop]: Abstraction has 7555 states and 10027 transitions. [2025-01-10 02:39:00,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:39:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10027 transitions. [2025-01-10 02:39:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-10 02:39:00,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:00,433 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:00,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 02:39:00,434 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:39:00,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash -370685521, now seen corresponding path program 1 times [2025-01-10 02:39:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:00,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792774454] [2025-01-10 02:39:00,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:00,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 02:39:00,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 02:39:00,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:00,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:39:00,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:00,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792774454] [2025-01-10 02:39:00,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792774454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:00,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:00,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:00,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373667776] [2025-01-10 02:39:00,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:00,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:00,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:00,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:00,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:00,561 INFO L87 Difference]: Start difference. First operand 7555 states and 10027 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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 02:39:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:00,658 INFO L93 Difference]: Finished difference Result 7558 states and 10027 transitions. [2025-01-10 02:39:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:00,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-10 02:39:00,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:00,667 INFO L225 Difference]: With dead ends: 7558 [2025-01-10 02:39:00,667 INFO L226 Difference]: Without dead ends: 7555 [2025-01-10 02:39:00,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:00,669 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:00,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 374 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7555 states. [2025-01-10 02:39:00,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7555 to 7555. [2025-01-10 02:39:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7549 states have (on average 1.3234865545105312) internal successors, (9991), 7554 states have internal predecessors, (9991), 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 02:39:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 9991 transitions. [2025-01-10 02:39:00,753 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 9991 transitions. Word has length 100 [2025-01-10 02:39:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:00,753 INFO L471 AbstractCegarLoop]: Abstraction has 7555 states and 9991 transitions. [2025-01-10 02:39:00,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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 02:39:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 9991 transitions. [2025-01-10 02:39:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 02:39:00,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:00,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:00,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 02:39:00,756 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:39:00,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash -416719300, now seen corresponding path program 1 times [2025-01-10 02:39:00,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:00,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012610541] [2025-01-10 02:39:00,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:00,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:00,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 02:39:00,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 02:39:00,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:00,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:39:00,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:00,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012610541] [2025-01-10 02:39:00,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012610541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:00,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:00,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:00,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561961826] [2025-01-10 02:39:00,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:00,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:00,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:00,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:00,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:00,872 INFO L87 Difference]: Start difference. First operand 7555 states and 9991 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 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 02:39:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:00,946 INFO L93 Difference]: Finished difference Result 8840 states and 11753 transitions. [2025-01-10 02:39:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:00,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 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 101 [2025-01-10 02:39:00,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:00,952 INFO L225 Difference]: With dead ends: 8840 [2025-01-10 02:39:00,952 INFO L226 Difference]: Without dead ends: 4630 [2025-01-10 02:39:00,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:00,955 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 140 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:00,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 320 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4630 states. [2025-01-10 02:39:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4630 to 4228. [2025-01-10 02:39:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4228 states, 4225 states have (on average 1.2953846153846154) internal successors, (5473), 4227 states have internal predecessors, (5473), 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 02:39:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4228 states to 4228 states and 5473 transitions. [2025-01-10 02:39:00,985 INFO L78 Accepts]: Start accepts. Automaton has 4228 states and 5473 transitions. Word has length 101 [2025-01-10 02:39:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:00,986 INFO L471 AbstractCegarLoop]: Abstraction has 4228 states and 5473 transitions. [2025-01-10 02:39:00,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 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 02:39:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4228 states and 5473 transitions. [2025-01-10 02:39:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 02:39:00,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:00,988 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:00,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 02:39:00,988 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:39:00,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1721128260, now seen corresponding path program 1 times [2025-01-10 02:39:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:00,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851183116] [2025-01-10 02:39:00,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:00,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:01,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 02:39:01,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 02:39:01,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:01,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:39:01,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:01,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851183116] [2025-01-10 02:39:01,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851183116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:01,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:01,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:01,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124572184] [2025-01-10 02:39:01,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:01,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:01,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:01,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:01,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:01,085 INFO L87 Difference]: Start difference. First operand 4228 states and 5473 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:39:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:01,163 INFO L93 Difference]: Finished difference Result 4229 states and 5473 transitions. [2025-01-10 02:39:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:01,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-01-10 02:39:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:01,169 INFO L225 Difference]: With dead ends: 4229 [2025-01-10 02:39:01,169 INFO L226 Difference]: Without dead ends: 4226 [2025-01-10 02:39:01,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:01,170 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 151 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:01,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 379 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4226 states. [2025-01-10 02:39:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4226 to 4226. [2025-01-10 02:39:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4226 states, 4225 states have (on average 1.288757396449704) internal successors, (5445), 4225 states have internal predecessors, (5445), 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 02:39:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 5445 transitions. [2025-01-10 02:39:01,196 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 5445 transitions. Word has length 102 [2025-01-10 02:39:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:01,197 INFO L471 AbstractCegarLoop]: Abstraction has 4226 states and 5445 transitions. [2025-01-10 02:39:01,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:39:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 5445 transitions. [2025-01-10 02:39:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 02:39:01,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:01,199 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:01,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-10 02:39:01,199 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:39:01,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash -33396272, now seen corresponding path program 1 times [2025-01-10 02:39:01,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:01,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957708195] [2025-01-10 02:39:01,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:01,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 02:39:01,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 02:39:01,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:01,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:39:01,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:01,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957708195] [2025-01-10 02:39:01,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957708195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:01,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:01,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:01,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301861849] [2025-01-10 02:39:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:01,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:01,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:01,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:01,277 INFO L87 Difference]: Start difference. First operand 4226 states and 5445 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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 02:39:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:01,331 INFO L93 Difference]: Finished difference Result 4227 states and 5445 transitions. [2025-01-10 02:39:01,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:01,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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 102 [2025-01-10 02:39:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:01,337 INFO L225 Difference]: With dead ends: 4227 [2025-01-10 02:39:01,337 INFO L226 Difference]: Without dead ends: 4226 [2025-01-10 02:39:01,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:01,338 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 131 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:01,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 376 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:01,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4226 states. [2025-01-10 02:39:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4226 to 4226. [2025-01-10 02:39:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4226 states, 4225 states have (on average 1.2868639053254438) internal successors, (5437), 4225 states have internal predecessors, (5437), 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 02:39:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 5437 transitions. [2025-01-10 02:39:01,407 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 5437 transitions. Word has length 102 [2025-01-10 02:39:01,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:01,408 INFO L471 AbstractCegarLoop]: Abstraction has 4226 states and 5437 transitions. [2025-01-10 02:39:01,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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 02:39:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 5437 transitions. [2025-01-10 02:39:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 02:39:01,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:01,414 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:01,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-10 02:39:01,414 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:39:01,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash -971149774, now seen corresponding path program 1 times [2025-01-10 02:39:01,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:01,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89562181] [2025-01-10 02:39:01,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:01,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:01,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 02:39:01,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 02:39:01,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:01,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:39:01,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:01,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89562181] [2025-01-10 02:39:01,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89562181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:01,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:01,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:01,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117528154] [2025-01-10 02:39:01,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:01,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:01,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:01,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:01,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:01,495 INFO L87 Difference]: Start difference. First operand 4226 states and 5437 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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 02:39:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:01,559 INFO L93 Difference]: Finished difference Result 4448 states and 5729 transitions. [2025-01-10 02:39:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:01,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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 104 [2025-01-10 02:39:01,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:01,564 INFO L225 Difference]: With dead ends: 4448 [2025-01-10 02:39:01,564 INFO L226 Difference]: Without dead ends: 3787 [2025-01-10 02:39:01,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:01,566 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 166 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:01,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 456 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2025-01-10 02:39:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3566. [2025-01-10 02:39:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3566 states, 3565 states have (on average 1.279382889200561) internal successors, (4561), 3565 states have internal predecessors, (4561), 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 02:39:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 4561 transitions. [2025-01-10 02:39:01,582 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 4561 transitions. Word has length 104 [2025-01-10 02:39:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:01,583 INFO L471 AbstractCegarLoop]: Abstraction has 3566 states and 4561 transitions. [2025-01-10 02:39:01,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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 02:39:01,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 4561 transitions. [2025-01-10 02:39:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 02:39:01,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:01,585 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:01,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-10 02:39:01,585 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:39:01,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2061057458, now seen corresponding path program 2 times [2025-01-10 02:39:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146113520] [2025-01-10 02:39:01,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:39:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:01,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-01-10 02:39:01,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 104 statements. [2025-01-10 02:39:01,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:39:01,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-10 02:39:01,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:01,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146113520] [2025-01-10 02:39:01,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146113520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:01,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:01,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:01,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539511805] [2025-01-10 02:39:01,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:01,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:01,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:01,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:01,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:01,627 INFO L87 Difference]: Start difference. First operand 3566 states and 4561 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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 02:39:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:01,694 INFO L93 Difference]: Finished difference Result 7111 states and 9101 transitions. [2025-01-10 02:39:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:01,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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 104 [2025-01-10 02:39:01,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:01,704 INFO L225 Difference]: With dead ends: 7111 [2025-01-10 02:39:01,704 INFO L226 Difference]: Without dead ends: 3566 [2025-01-10 02:39:01,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:39:01,712 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 206 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:01,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 76 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:01,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2025-01-10 02:39:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 3566. [2025-01-10 02:39:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3566 states, 3565 states have (on average 1.2647966339410939) internal successors, (4509), 3565 states have internal predecessors, (4509), 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 02:39:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 4509 transitions. [2025-01-10 02:39:01,748 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 4509 transitions. Word has length 104 [2025-01-10 02:39:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:01,749 INFO L471 AbstractCegarLoop]: Abstraction has 3566 states and 4509 transitions. [2025-01-10 02:39:01,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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 02:39:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 4509 transitions. [2025-01-10 02:39:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 02:39:01,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:01,752 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:01,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-10 02:39:01,752 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:39:01,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash 391771132, now seen corresponding path program 1 times [2025-01-10 02:39:01,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:01,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921020510] [2025-01-10 02:39:01,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:01,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:01,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 02:39:01,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 02:39:01,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:01,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:39:01,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:01,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921020510] [2025-01-10 02:39:01,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921020510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:01,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:01,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:01,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748866669] [2025-01-10 02:39:01,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:01,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:01,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:01,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:01,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:01,841 INFO L87 Difference]: Start difference. First operand 3566 states and 4509 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 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 02:39:01,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:01,957 INFO L93 Difference]: Finished difference Result 3567 states and 4509 transitions. [2025-01-10 02:39:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:01,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 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 104 [2025-01-10 02:39:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:01,960 INFO L225 Difference]: With dead ends: 3567 [2025-01-10 02:39:01,960 INFO L226 Difference]: Without dead ends: 2554 [2025-01-10 02:39:01,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:01,963 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 146 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:01,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 529 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2025-01-10 02:39:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2554. [2025-01-10 02:39:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2553 states have (on average 1.2585193889541715) internal successors, (3213), 2553 states have internal predecessors, (3213), 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 02:39:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3213 transitions. [2025-01-10 02:39:01,976 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3213 transitions. Word has length 104 [2025-01-10 02:39:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:01,976 INFO L471 AbstractCegarLoop]: Abstraction has 2554 states and 3213 transitions. [2025-01-10 02:39:01,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 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 02:39:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3213 transitions. [2025-01-10 02:39:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-10 02:39:01,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:01,979 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:01,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-10 02:39:01,979 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 02:39:01,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash -480462132, now seen corresponding path program 1 times [2025-01-10 02:39:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:01,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406329483] [2025-01-10 02:39:01,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:01,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:01,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-10 02:39:01,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-10 02:39:01,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:01,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:39:02,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406329483] [2025-01-10 02:39:02,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406329483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:02,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:02,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:02,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439834312] [2025-01-10 02:39:02,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:02,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:02,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:02,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:02,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:02,086 INFO L87 Difference]: Start difference. First operand 2554 states and 3213 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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 02:39:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:02,213 INFO L93 Difference]: Finished difference Result 2554 states and 3213 transitions. [2025-01-10 02:39:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:02,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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 126 [2025-01-10 02:39:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:02,214 INFO L225 Difference]: With dead ends: 2554 [2025-01-10 02:39:02,214 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:39:02,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:02,215 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 144 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:02,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 546 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:39:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:39:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:39:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:39:02,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2025-01-10 02:39:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:02,216 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:39:02,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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 02:39:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:39:02,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-01-10 02:39:02,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-01-10 02:39:02,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-10 02:39:02,221 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:02,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:39:02,227 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:39:02,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:39:02 BoogieIcfgContainer [2025-01-10 02:39:02,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:39:02,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:39:02,233 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:39:02,233 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:39:02,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:38:52" (3/4) ... [2025-01-10 02:39:02,234 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:39:02,243 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-10 02:39:02,244 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:39:02,245 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:39:02,245 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:39:02,316 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:39:02,316 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:39:02,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:39:02,318 INFO L158 Benchmark]: Toolchain (without parser) took 10494.56ms. Allocated memory was 142.6MB in the beginning and 763.4MB in the end (delta: 620.8MB). Free memory was 106.6MB in the beginning and 429.9MB in the end (delta: -323.3MB). Peak memory consumption was 297.7MB. Max. memory is 16.1GB. [2025-01-10 02:39:02,319 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:39:02,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.81ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 02:39:02,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.92ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:39:02,319 INFO L158 Benchmark]: Boogie Preprocessor took 54.43ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:39:02,319 INFO L158 Benchmark]: RCFGBuilder took 472.19ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 65.1MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 02:39:02,319 INFO L158 Benchmark]: TraceAbstraction took 9584.51ms. Allocated memory was 142.6MB in the beginning and 763.4MB in the end (delta: 620.8MB). Free memory was 64.1MB in the beginning and 438.2MB in the end (delta: -374.1MB). Peak memory consumption was 247.4MB. Max. memory is 16.1GB. [2025-01-10 02:39:02,321 INFO L158 Benchmark]: Witness Printer took 84.08ms. Allocated memory is still 763.4MB. Free memory was 438.2MB in the beginning and 429.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:39:02,321 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.81ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.92ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.43ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 472.19ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 65.1MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9584.51ms. Allocated memory was 142.6MB in the beginning and 763.4MB in the end (delta: 620.8MB). Free memory was 64.1MB in the beginning and 438.2MB in the end (delta: -374.1MB). Peak memory consumption was 247.4MB. Max. memory is 16.1GB. * Witness Printer took 84.08ms. Allocated memory is still 763.4MB. Free memory was 438.2MB in the beginning and 429.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 90 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 37, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6725 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6725 mSDsluCounter, 11880 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5909 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3523 IncrementalHoareTripleChecker+Invalid, 3699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 5971 mSDtfsCounter, 3523 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10442occurred in iteration=20, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 8735 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2727 NumberOfCodeBlocks, 2609 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2690 ConstructedInterpolants, 0 QuantifiedInterpolants, 10363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 869/869 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 02:39:02,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE