./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 c802d0dd4f8edaf03f1251784a424c8f295192f6a4e7c65ec93469eacce08251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:41:36,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:41:36,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:41:36,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:41:36,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:41:36,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:41:36,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:41:36,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:41:36,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:41:36,815 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:41:36,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:41:36,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:41:36,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:41:36,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:41:36,815 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:41:36,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:41:36,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:41:36,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:41:36,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:41:36,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:41:36,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:41:36,817 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:41:36,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:41:36,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:41:36,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:41:36,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:41:36,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:41:36,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:41:36,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:41:36,817 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/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 -> c802d0dd4f8edaf03f1251784a424c8f295192f6a4e7c65ec93469eacce08251 [2025-03-17 14:41:37,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:41:37,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:41:37,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:41:37,066 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:41:37,066 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:41:37,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2025-03-17 14:41:38,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc344188/a7773712985343a8b1e37d3dc139b0e9/FLAG409f69e12 [2025-03-17 14:41:38,492 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:41:38,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2025-03-17 14:41:38,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc344188/a7773712985343a8b1e37d3dc139b0e9/FLAG409f69e12 [2025-03-17 14:41:38,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc344188/a7773712985343a8b1e37d3dc139b0e9 [2025-03-17 14:41:38,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:41:38,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:41:38,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:41:38,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:41:38,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:41:38,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e531fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38, skipping insertion in model container [2025-03-17 14:41:38,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:41:38,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:41:38,715 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:41:38,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:41:38,758 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:41:38,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38 WrapperNode [2025-03-17 14:41:38,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:41:38,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:41:38,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:41:38,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:41:38,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,796 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 662 [2025-03-17 14:41:38,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:41:38,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:41:38,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:41:38,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:41:38,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,825 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-03-17 14:41:38,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:41:38,850 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:41:38,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:41:38,853 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:41:38,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (1/1) ... [2025-03-17 14:41:38,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:41:38,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:38,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:41:38,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:41:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:41:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:41:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:41:38,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:41:38,963 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:41:38,964 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:41:39,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume false; [2025-03-17 14:41:39,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume !false; [2025-03-17 14:41:39,440 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2025-03-17 14:41:39,440 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:41:39,467 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:41:39,467 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:41:39,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:39 BoogieIcfgContainer [2025-03-17 14:41:39,468 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:41:39,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:41:39,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:41:39,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:41:39,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:41:38" (1/3) ... [2025-03-17 14:41:39,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481d6930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:39, skipping insertion in model container [2025-03-17 14:41:39,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:38" (2/3) ... [2025-03-17 14:41:39,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481d6930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:39, skipping insertion in model container [2025-03-17 14:41:39,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:39" (3/3) ... [2025-03-17 14:41:39,479 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2025-03-17 14:41:39,490 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:41:39,491 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_srvr_3a_alt.BV.c.cil.c that has 1 procedures, 182 locations, 1 initial locations, 1 loop locations, and 8 error locations. [2025-03-17 14:41:39,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:41:39,541 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;@7770c389, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:41:39,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 14:41:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 173 states have (on average 1.745664739884393) internal successors, (302), 181 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:39,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 14:41:39,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:39,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:39,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:39,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash -837716931, now seen corresponding path program 1 times [2025-03-17 14:41:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293261123] [2025-03-17 14:41:39,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:39,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:41:39,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:41:39,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:39,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:39,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:39,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293261123] [2025-03-17 14:41:39,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293261123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:39,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:39,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:41:39,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751620074] [2025-03-17 14:41:39,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:39,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:41:39,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:39,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:41:39,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:41:39,712 INFO L87 Difference]: Start difference. First operand has 182 states, 173 states have (on average 1.745664739884393) internal successors, (302), 181 states have internal predecessors, (302), 0 states have call successors, (0), 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, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:39,747 INFO L93 Difference]: Finished difference Result 337 states and 562 transitions. [2025-03-17 14:41:39,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:41:39,749 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 14:41:39,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:39,754 INFO L225 Difference]: With dead ends: 337 [2025-03-17 14:41:39,754 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 14:41:39,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:41:39,762 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:39,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 14:41:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-17 14:41:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.5850340136054422) internal successors, (233), 150 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 233 transitions. [2025-03-17 14:41:39,802 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 233 transitions. Word has length 16 [2025-03-17 14:41:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:39,803 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 233 transitions. [2025-03-17 14:41:39,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 233 transitions. [2025-03-17 14:41:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 14:41:39,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:39,804 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-03-17 14:41:39,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:41:39,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:39,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:39,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2129817696, now seen corresponding path program 1 times [2025-03-17 14:41:39,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:39,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535214966] [2025-03-17 14:41:39,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:39,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:39,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 14:41:39,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:41:39,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:39,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:39,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:39,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535214966] [2025-03-17 14:41:39,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535214966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:39,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:39,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:41:39,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352344454] [2025-03-17 14:41:39,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:39,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:39,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:39,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:39,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:39,941 INFO L87 Difference]: Start difference. First operand 151 states and 233 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 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-03-17 14:41:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:40,034 INFO L93 Difference]: Finished difference Result 419 states and 649 transitions. [2025-03-17 14:41:40,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:40,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 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-03-17 14:41:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:40,036 INFO L225 Difference]: With dead ends: 419 [2025-03-17 14:41:40,036 INFO L226 Difference]: Without dead ends: 281 [2025-03-17 14:41:40,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:40,037 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 184 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:40,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 407 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-17 14:41:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-03-17 14:41:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 277 states have (on average 1.5667870036101084) internal successors, (434), 280 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 434 transitions. [2025-03-17 14:41:40,047 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 434 transitions. Word has length 39 [2025-03-17 14:41:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:40,048 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 434 transitions. [2025-03-17 14:41:40,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 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-03-17 14:41:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 434 transitions. [2025-03-17 14:41:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 14:41:40,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:40,049 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] [2025-03-17 14:41:40,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:41:40,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:40,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1597039239, now seen corresponding path program 1 times [2025-03-17 14:41:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:40,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264393616] [2025-03-17 14:41:40,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:40,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 14:41:40,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 14:41:40,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:40,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:40,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:40,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264393616] [2025-03-17 14:41:40,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264393616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:40,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:40,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:40,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803240474] [2025-03-17 14:41:40,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:40,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:40,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:40,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:40,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:40,107 INFO L87 Difference]: Start difference. First operand 281 states and 434 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:40,243 INFO L93 Difference]: Finished difference Result 589 states and 911 transitions. [2025-03-17 14:41:40,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:40,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-17 14:41:40,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:40,245 INFO L225 Difference]: With dead ends: 589 [2025-03-17 14:41:40,245 INFO L226 Difference]: Without dead ends: 321 [2025-03-17 14:41:40,246 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-03-17 14:41:40,246 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 9 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:40,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 359 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-17 14:41:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2025-03-17 14:41:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 317 states have (on average 1.526813880126183) internal successors, (484), 320 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 484 transitions. [2025-03-17 14:41:40,266 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 484 transitions. Word has length 54 [2025-03-17 14:41:40,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:40,266 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 484 transitions. [2025-03-17 14:41:40,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 484 transitions. [2025-03-17 14:41:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 14:41:40,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:40,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 14:41:40,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:41:40,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:40,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash -343475315, now seen corresponding path program 1 times [2025-03-17 14:41:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:40,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929696726] [2025-03-17 14:41:40,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:40,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 14:41:40,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 14:41:40,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:40,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:41:40,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:40,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929696726] [2025-03-17 14:41:40,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929696726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:40,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:40,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:40,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271435797] [2025-03-17 14:41:40,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:40,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:40,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:40,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:40,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:40,361 INFO L87 Difference]: Start difference. First operand 321 states and 484 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-03-17 14:41:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:40,520 INFO L93 Difference]: Finished difference Result 717 states and 1101 transitions. [2025-03-17 14:41:40,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:40,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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 74 [2025-03-17 14:41:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:40,522 INFO L225 Difference]: With dead ends: 717 [2025-03-17 14:41:40,522 INFO L226 Difference]: Without dead ends: 409 [2025-03-17 14:41:40,523 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-03-17 14:41:40,523 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 16 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:40,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 359 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-03-17 14:41:40,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 401. [2025-03-17 14:41:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 397 states have (on average 1.4458438287153652) internal successors, (574), 400 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 574 transitions. [2025-03-17 14:41:40,539 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 574 transitions. Word has length 74 [2025-03-17 14:41:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:40,539 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 574 transitions. [2025-03-17 14:41:40,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-03-17 14:41:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 574 transitions. [2025-03-17 14:41:40,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 14:41:40,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:40,545 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 14:41:40,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:41:40,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:40,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:40,546 INFO L85 PathProgramCache]: Analyzing trace with hash -13709554, now seen corresponding path program 1 times [2025-03-17 14:41:40,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:40,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377632983] [2025-03-17 14:41:40,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:40,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:40,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 14:41:40,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 14:41:40,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:40,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:41:40,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:40,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377632983] [2025-03-17 14:41:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377632983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:40,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:40,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508727053] [2025-03-17 14:41:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:40,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:40,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:40,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:40,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:40,601 INFO L87 Difference]: Start difference. First operand 401 states and 574 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-03-17 14:41:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:40,725 INFO L93 Difference]: Finished difference Result 833 states and 1199 transitions. [2025-03-17 14:41:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:40,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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 74 [2025-03-17 14:41:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:40,727 INFO L225 Difference]: With dead ends: 833 [2025-03-17 14:41:40,727 INFO L226 Difference]: Without dead ends: 445 [2025-03-17 14:41:40,728 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-03-17 14:41:40,728 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 9 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:40,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 360 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-17 14:41:40,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-03-17 14:41:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 441 states have (on average 1.4240362811791383) internal successors, (628), 444 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 628 transitions. [2025-03-17 14:41:40,747 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 628 transitions. Word has length 74 [2025-03-17 14:41:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:40,749 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 628 transitions. [2025-03-17 14:41:40,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-03-17 14:41:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 628 transitions. [2025-03-17 14:41:40,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 14:41:40,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:40,750 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-03-17 14:41:40,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:41:40,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:40,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:40,751 INFO L85 PathProgramCache]: Analyzing trace with hash 200254944, now seen corresponding path program 1 times [2025-03-17 14:41:40,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:40,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188658517] [2025-03-17 14:41:40,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:40,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:40,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 14:41:40,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 14:41:40,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:40,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 14:41:40,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:40,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188658517] [2025-03-17 14:41:40,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188658517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:40,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:40,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593282163] [2025-03-17 14:41:40,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:40,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:40,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:40,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:40,848 INFO L87 Difference]: Start difference. First operand 445 states and 628 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-03-17 14:41:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:40,974 INFO L93 Difference]: Finished difference Result 925 states and 1315 transitions. [2025-03-17 14:41:40,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:40,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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 94 [2025-03-17 14:41:40,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:40,976 INFO L225 Difference]: With dead ends: 925 [2025-03-17 14:41:40,976 INFO L226 Difference]: Without dead ends: 493 [2025-03-17 14:41:40,977 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-03-17 14:41:40,977 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 9 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:40,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 359 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-17 14:41:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-03-17 14:41:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 489 states have (on average 1.4028629856850716) internal successors, (686), 492 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 686 transitions. [2025-03-17 14:41:40,986 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 686 transitions. Word has length 94 [2025-03-17 14:41:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:40,986 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 686 transitions. [2025-03-17 14:41:40,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-03-17 14:41:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 686 transitions. [2025-03-17 14:41:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 14:41:40,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:40,988 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-17 14:41:40,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:41:40,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:40,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1666236529, now seen corresponding path program 1 times [2025-03-17 14:41:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:40,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378982675] [2025-03-17 14:41:40,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:40,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:41,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 14:41:41,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 14:41:41,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:41,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:41:41,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:41,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378982675] [2025-03-17 14:41:41,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378982675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:41,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:41,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882371724] [2025-03-17 14:41:41,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:41,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:41,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:41,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:41,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:41,056 INFO L87 Difference]: Start difference. First operand 493 states and 686 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:41,180 INFO L93 Difference]: Finished difference Result 1051 states and 1441 transitions. [2025-03-17 14:41:41,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:41,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 115 [2025-03-17 14:41:41,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:41,182 INFO L225 Difference]: With dead ends: 1051 [2025-03-17 14:41:41,182 INFO L226 Difference]: Without dead ends: 571 [2025-03-17 14:41:41,183 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-03-17 14:41:41,184 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 10 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:41,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 360 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-17 14:41:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-03-17 14:41:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 567 states have (on average 1.3650793650793651) internal successors, (774), 570 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 774 transitions. [2025-03-17 14:41:41,194 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 774 transitions. Word has length 115 [2025-03-17 14:41:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:41,194 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 774 transitions. [2025-03-17 14:41:41,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 774 transitions. [2025-03-17 14:41:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 14:41:41,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:41,196 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2025-03-17 14:41:41,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:41:41,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:41,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:41,197 INFO L85 PathProgramCache]: Analyzing trace with hash 616772515, now seen corresponding path program 1 times [2025-03-17 14:41:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:41,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087774679] [2025-03-17 14:41:41,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:41,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:41,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 14:41:41,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 14:41:41,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:41,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-17 14:41:41,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:41,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087774679] [2025-03-17 14:41:41,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087774679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:41,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:41,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:41,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989119434] [2025-03-17 14:41:41,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:41,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:41,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:41,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:41,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:41,282 INFO L87 Difference]: Start difference. First operand 571 states and 774 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:41,311 INFO L93 Difference]: Finished difference Result 1131 states and 1531 transitions. [2025-03-17 14:41:41,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:41,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-03-17 14:41:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:41,313 INFO L225 Difference]: With dead ends: 1131 [2025-03-17 14:41:41,313 INFO L226 Difference]: Without dead ends: 573 [2025-03-17 14:41:41,314 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-03-17 14:41:41,314 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:41,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 438 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-17 14:41:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2025-03-17 14:41:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 569 states have (on average 1.3637961335676625) internal successors, (776), 572 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 776 transitions. [2025-03-17 14:41:41,326 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 776 transitions. Word has length 120 [2025-03-17 14:41:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:41,327 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 776 transitions. [2025-03-17 14:41:41,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 776 transitions. [2025-03-17 14:41:41,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 14:41:41,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:41,328 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2025-03-17 14:41:41,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:41:41,329 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:41,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:41,329 INFO L85 PathProgramCache]: Analyzing trace with hash -844807484, now seen corresponding path program 1 times [2025-03-17 14:41:41,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:41,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20316905] [2025-03-17 14:41:41,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:41,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:41,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 14:41:41,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 14:41:41,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:41,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-17 14:41:41,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:41,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20316905] [2025-03-17 14:41:41,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20316905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:41,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:41,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:41,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921096694] [2025-03-17 14:41:41,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:41,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:41,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:41,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:41,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:41,388 INFO L87 Difference]: Start difference. First operand 573 states and 776 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:41,525 INFO L93 Difference]: Finished difference Result 1185 states and 1619 transitions. [2025-03-17 14:41:41,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:41,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-03-17 14:41:41,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:41,527 INFO L225 Difference]: With dead ends: 1185 [2025-03-17 14:41:41,527 INFO L226 Difference]: Without dead ends: 625 [2025-03-17 14:41:41,528 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-03-17 14:41:41,528 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 9 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:41,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 359 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:41,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-17 14:41:41,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2025-03-17 14:41:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 621 states have (on average 1.3494363929146538) internal successors, (838), 624 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 838 transitions. [2025-03-17 14:41:41,538 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 838 transitions. Word has length 120 [2025-03-17 14:41:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:41,538 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 838 transitions. [2025-03-17 14:41:41,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 838 transitions. [2025-03-17 14:41:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 14:41:41,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:41,540 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2025-03-17 14:41:41,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:41:41,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:41,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:41,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1857707666, now seen corresponding path program 1 times [2025-03-17 14:41:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:41,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962123595] [2025-03-17 14:41:41,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:41,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 14:41:41,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 14:41:41,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:41,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-17 14:41:41,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962123595] [2025-03-17 14:41:41,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962123595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:41,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:41,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361407770] [2025-03-17 14:41:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:41,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:41,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:41,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:41,598 INFO L87 Difference]: Start difference. First operand 625 states and 838 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-03-17 14:41:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:41,722 INFO L93 Difference]: Finished difference Result 1293 states and 1751 transitions. [2025-03-17 14:41:41,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:41,722 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 142 [2025-03-17 14:41:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:41,724 INFO L225 Difference]: With dead ends: 1293 [2025-03-17 14:41:41,724 INFO L226 Difference]: Without dead ends: 681 [2025-03-17 14:41:41,725 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-03-17 14:41:41,727 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 9 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:41,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 359 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-17 14:41:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2025-03-17 14:41:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 677 states have (on average 1.3353028064992614) internal successors, (904), 680 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 904 transitions. [2025-03-17 14:41:41,741 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 904 transitions. Word has length 142 [2025-03-17 14:41:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:41,741 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 904 transitions. [2025-03-17 14:41:41,741 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-03-17 14:41:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 904 transitions. [2025-03-17 14:41:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 14:41:41,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:41,743 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2025-03-17 14:41:41,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:41:41,743 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:41,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash -809581624, now seen corresponding path program 1 times [2025-03-17 14:41:41,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:41,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473653134] [2025-03-17 14:41:41,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:41,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:41,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 14:41:41,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 14:41:41,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:41,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-17 14:41:41,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:41,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473653134] [2025-03-17 14:41:41,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473653134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:41,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:41,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:41,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526284614] [2025-03-17 14:41:41,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:41,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:41,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:41,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:41,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:41,801 INFO L87 Difference]: Start difference. First operand 681 states and 904 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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-03-17 14:41:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:41,924 INFO L93 Difference]: Finished difference Result 1409 states and 1891 transitions. [2025-03-17 14:41:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:41,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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 147 [2025-03-17 14:41:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:41,927 INFO L225 Difference]: With dead ends: 1409 [2025-03-17 14:41:41,928 INFO L226 Difference]: Without dead ends: 741 [2025-03-17 14:41:41,929 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-03-17 14:41:41,930 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 12 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:41,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 344 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-03-17 14:41:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2025-03-17 14:41:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 737 states have (on average 1.32157394843962) internal successors, (974), 740 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 974 transitions. [2025-03-17 14:41:41,941 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 974 transitions. Word has length 147 [2025-03-17 14:41:41,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:41,941 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 974 transitions. [2025-03-17 14:41:41,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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-03-17 14:41:41,942 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 974 transitions. [2025-03-17 14:41:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 14:41:41,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:41,943 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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-03-17 14:41:41,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:41:41,943 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:41,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:41,943 INFO L85 PathProgramCache]: Analyzing trace with hash -937149973, now seen corresponding path program 1 times [2025-03-17 14:41:41,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:41,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929880670] [2025-03-17 14:41:41,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:41,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:41,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 14:41:41,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 14:41:41,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:41,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 164 proven. 25 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-17 14:41:42,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:42,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929880670] [2025-03-17 14:41:42,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929880670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:42,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969408629] [2025-03-17 14:41:42,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:42,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:42,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:42,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:42,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:41:42,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 14:41:42,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 14:41:42,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:42,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:42,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:41:42,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-17 14:41:42,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:42,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969408629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:42,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:42,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 14:41:42,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089548982] [2025-03-17 14:41:42,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:42,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:42,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:42,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:42,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:42,318 INFO L87 Difference]: Start difference. First operand 741 states and 974 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:42,367 INFO L93 Difference]: Finished difference Result 1469 states and 1930 transitions. [2025-03-17 14:41:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:42,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 174 [2025-03-17 14:41:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:42,370 INFO L225 Difference]: With dead ends: 1469 [2025-03-17 14:41:42,370 INFO L226 Difference]: Without dead ends: 1101 [2025-03-17 14:41:42,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:42,372 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 162 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:42,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 404 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-03-17 14:41:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1101. [2025-03-17 14:41:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1097 states have (on average 1.3190519598906107) internal successors, (1447), 1100 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1447 transitions. [2025-03-17 14:41:42,390 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1447 transitions. Word has length 174 [2025-03-17 14:41:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:42,391 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1447 transitions. [2025-03-17 14:41:42,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1447 transitions. [2025-03-17 14:41:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 14:41:42,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:42,393 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 14:41:42,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:42,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 14:41:42,597 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:42,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:42,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1230294114, now seen corresponding path program 1 times [2025-03-17 14:41:42,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:42,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533902856] [2025-03-17 14:41:42,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:42,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:42,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 14:41:42,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 14:41:42,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:42,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:41:42,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [977976776] [2025-03-17 14:41:42,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:42,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:42,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:42,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:42,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:41:42,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 14:41:42,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 14:41:42,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:42,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:42,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:41:42,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-17 14:41:42,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:42,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:42,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533902856] [2025-03-17 14:41:42,802 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:41:42,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977976776] [2025-03-17 14:41:42,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977976776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:42,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:42,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:42,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317922593] [2025-03-17 14:41:42,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:42,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:42,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:42,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:42,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:41:42,803 INFO L87 Difference]: Start difference. First operand 1101 states and 1447 transitions. Second operand has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:43,008 INFO L93 Difference]: Finished difference Result 3401 states and 4527 transitions. [2025-03-17 14:41:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:43,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 181 [2025-03-17 14:41:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:43,015 INFO L225 Difference]: With dead ends: 3401 [2025-03-17 14:41:43,015 INFO L226 Difference]: Without dead ends: 2313 [2025-03-17 14:41:43,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 178 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-03-17 14:41:43,017 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 232 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:43,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 709 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:41:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2025-03-17 14:41:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1465. [2025-03-17 14:41:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1461 states have (on average 1.3305954825462012) internal successors, (1944), 1464 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1944 transitions. [2025-03-17 14:41:43,048 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1944 transitions. Word has length 181 [2025-03-17 14:41:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:43,050 INFO L471 AbstractCegarLoop]: Abstraction has 1465 states and 1944 transitions. [2025-03-17 14:41:43,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1944 transitions. [2025-03-17 14:41:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 14:41:43,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:43,053 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 14:41:43,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:43,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 14:41:43,254 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:43,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:43,254 INFO L85 PathProgramCache]: Analyzing trace with hash 889993085, now seen corresponding path program 1 times [2025-03-17 14:41:43,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:43,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502477865] [2025-03-17 14:41:43,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:43,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:43,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 14:41:43,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 14:41:43,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:43,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-17 14:41:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502477865] [2025-03-17 14:41:43,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502477865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:43,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:43,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:43,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143447189] [2025-03-17 14:41:43,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:43,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:43,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:43,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:43,309 INFO L87 Difference]: Start difference. First operand 1465 states and 1944 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 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-03-17 14:41:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:43,359 INFO L93 Difference]: Finished difference Result 3924 states and 5197 transitions. [2025-03-17 14:41:43,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:43,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 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 181 [2025-03-17 14:41:43,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:43,366 INFO L225 Difference]: With dead ends: 3924 [2025-03-17 14:41:43,366 INFO L226 Difference]: Without dead ends: 2472 [2025-03-17 14:41:43,368 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-03-17 14:41:43,368 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 160 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:43,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 621 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2025-03-17 14:41:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2468. [2025-03-17 14:41:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2464 states have (on average 1.3238636363636365) internal successors, (3262), 2467 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3262 transitions. [2025-03-17 14:41:43,408 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3262 transitions. Word has length 181 [2025-03-17 14:41:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:43,408 INFO L471 AbstractCegarLoop]: Abstraction has 2468 states and 3262 transitions. [2025-03-17 14:41:43,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 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-03-17 14:41:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3262 transitions. [2025-03-17 14:41:43,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-17 14:41:43,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:43,411 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 14:41:43,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:41:43,411 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:43,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash 515588206, now seen corresponding path program 1 times [2025-03-17 14:41:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:43,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458021442] [2025-03-17 14:41:43,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:43,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 14:41:43,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 14:41:43,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:43,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:41:43,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391854900] [2025-03-17 14:41:43,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:43,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:43,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:43,440 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:43,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:41:43,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 14:41:43,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 14:41:43,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:43,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:43,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:41:43,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-17 14:41:43,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:43,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:43,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458021442] [2025-03-17 14:41:43,628 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:41:43,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391854900] [2025-03-17 14:41:43,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391854900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:43,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:43,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:43,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614273247] [2025-03-17 14:41:43,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:43,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:43,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:43,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:43,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:41:43,630 INFO L87 Difference]: Start difference. First operand 2468 states and 3262 transitions. Second operand has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:43,816 INFO L93 Difference]: Finished difference Result 4620 states and 6067 transitions. [2025-03-17 14:41:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:43,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 182 [2025-03-17 14:41:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:43,826 INFO L225 Difference]: With dead ends: 4620 [2025-03-17 14:41:43,826 INFO L226 Difference]: Without dead ends: 3243 [2025-03-17 14:41:43,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 179 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-03-17 14:41:43,829 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 214 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:43,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 719 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2025-03-17 14:41:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 2475. [2025-03-17 14:41:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2471 states have (on average 1.3233508700930798) internal successors, (3270), 2474 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3270 transitions. [2025-03-17 14:41:43,880 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3270 transitions. Word has length 182 [2025-03-17 14:41:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:43,881 INFO L471 AbstractCegarLoop]: Abstraction has 2475 states and 3270 transitions. [2025-03-17 14:41:43,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3270 transitions. [2025-03-17 14:41:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 14:41:43,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:43,883 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-03-17 14:41:43,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:44,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:44,084 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:44,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:44,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1196634724, now seen corresponding path program 1 times [2025-03-17 14:41:44,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:44,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76477101] [2025-03-17 14:41:44,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:44,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:44,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 14:41:44,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 14:41:44,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:44,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-17 14:41:44,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:44,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76477101] [2025-03-17 14:41:44,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76477101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:44,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:44,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325352594] [2025-03-17 14:41:44,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:44,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:44,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:44,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:44,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:41:44,241 INFO L87 Difference]: Start difference. First operand 2475 states and 3270 transitions. Second operand has 4 states, 3 states have (on average 35.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:44,466 INFO L93 Difference]: Finished difference Result 4632 states and 6098 transitions. [2025-03-17 14:41:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:44,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 35.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 183 [2025-03-17 14:41:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:44,474 INFO L225 Difference]: With dead ends: 4632 [2025-03-17 14:41:44,474 INFO L226 Difference]: Without dead ends: 2984 [2025-03-17 14:41:44,475 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-03-17 14:41:44,476 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 184 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:44,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 707 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:41:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2025-03-17 14:41:44,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2954. [2025-03-17 14:41:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2951 states have (on average 1.3131141985767536) internal successors, (3875), 2953 states have internal predecessors, (3875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3875 transitions. [2025-03-17 14:41:44,520 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3875 transitions. Word has length 183 [2025-03-17 14:41:44,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:44,521 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 3875 transitions. [2025-03-17 14:41:44,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 35.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3875 transitions. [2025-03-17 14:41:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 14:41:44,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:44,524 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 14:41:44,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:41:44,524 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:44,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1559029292, now seen corresponding path program 1 times [2025-03-17 14:41:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:44,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647218013] [2025-03-17 14:41:44,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:44,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:44,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 14:41:44,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 14:41:44,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:44,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:41:44,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1515790567] [2025-03-17 14:41:44,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:44,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:44,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:44,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:44,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:41:44,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 14:41:44,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 14:41:44,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:44,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:44,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:41:44,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 14:41:44,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:44,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:44,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647218013] [2025-03-17 14:41:44,864 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:41:44,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515790567] [2025-03-17 14:41:44,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515790567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:44,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:44,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:44,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936585822] [2025-03-17 14:41:44,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:44,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:44,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:44,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:44,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:44,865 INFO L87 Difference]: Start difference. First operand 2954 states and 3875 transitions. Second operand has 5 states, 4 states have (on average 34.25) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:45,069 INFO L93 Difference]: Finished difference Result 3522 states and 4585 transitions. [2025-03-17 14:41:45,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:41:45,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 34.25) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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 184 [2025-03-17 14:41:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:45,078 INFO L225 Difference]: With dead ends: 3522 [2025-03-17 14:41:45,078 INFO L226 Difference]: Without dead ends: 3521 [2025-03-17 14:41:45,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 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-03-17 14:41:45,080 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 384 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:45,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 871 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:41:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2025-03-17 14:41:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2958. [2025-03-17 14:41:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2958 states, 2955 states have (on average 1.3126903553299492) internal successors, (3879), 2957 states have internal predecessors, (3879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3879 transitions. [2025-03-17 14:41:45,140 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3879 transitions. Word has length 184 [2025-03-17 14:41:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:45,140 INFO L471 AbstractCegarLoop]: Abstraction has 2958 states and 3879 transitions. [2025-03-17 14:41:45,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 34.25) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3879 transitions. [2025-03-17 14:41:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-17 14:41:45,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:45,144 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-17 14:41:45,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:45,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:41:45,345 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:45,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:45,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1691609956, now seen corresponding path program 1 times [2025-03-17 14:41:45,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:45,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129986638] [2025-03-17 14:41:45,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:45,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:45,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 14:41:45,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 14:41:45,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:45,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:45,427 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2025-03-17 14:41:45,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:45,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129986638] [2025-03-17 14:41:45,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129986638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:45,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:45,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:45,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687353271] [2025-03-17 14:41:45,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:45,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:45,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:45,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:45,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:45,429 INFO L87 Difference]: Start difference. First operand 2958 states and 3879 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:45,564 INFO L93 Difference]: Finished difference Result 5439 states and 7223 transitions. [2025-03-17 14:41:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:45,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 224 [2025-03-17 14:41:45,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:45,568 INFO L225 Difference]: With dead ends: 5439 [2025-03-17 14:41:45,568 INFO L226 Difference]: Without dead ends: 1574 [2025-03-17 14:41:45,571 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-03-17 14:41:45,571 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 13 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:45,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 358 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:45,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2025-03-17 14:41:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2025-03-17 14:41:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1571 states have (on average 1.2953532781667727) internal successors, (2035), 1573 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2035 transitions. [2025-03-17 14:41:45,589 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2035 transitions. Word has length 224 [2025-03-17 14:41:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:45,589 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2035 transitions. [2025-03-17 14:41:45,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2035 transitions. [2025-03-17 14:41:45,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-17 14:41:45,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:45,592 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 14:41:45,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:41:45,592 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:45,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:45,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1629149791, now seen corresponding path program 1 times [2025-03-17 14:41:45,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:45,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543606860] [2025-03-17 14:41:45,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:45,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-17 14:41:45,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-17 14:41:45,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:45,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 578 proven. 25 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 14:41:45,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543606860] [2025-03-17 14:41:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543606860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866153] [2025-03-17 14:41:45,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:45,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:45,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:45,681 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:45,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:41:45,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-17 14:41:45,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-17 14:41:45,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:45,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:45,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:45,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 578 proven. 25 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 14:41:45,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:41:45,921 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 578 proven. 25 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 14:41:45,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:41:45,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:41:45,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-17 14:41:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533521951] [2025-03-17 14:41:45,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:41:45,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:41:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:45,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:41:45,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:45,924 INFO L87 Difference]: Start difference. First operand 1574 states and 2035 transitions. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:46,351 INFO L93 Difference]: Finished difference Result 5016 states and 6751 transitions. [2025-03-17 14:41:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:41:46,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 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 281 [2025-03-17 14:41:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:46,363 INFO L225 Difference]: With dead ends: 5016 [2025-03-17 14:41:46,363 INFO L226 Difference]: Without dead ends: 3335 [2025-03-17 14:41:46,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:41:46,365 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 579 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:46,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 861 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 14:41:46,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2025-03-17 14:41:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2146. [2025-03-17 14:41:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2143 states have (on average 1.3975734951003267) internal successors, (2995), 2145 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2995 transitions. [2025-03-17 14:41:46,400 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2995 transitions. Word has length 281 [2025-03-17 14:41:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:46,400 INFO L471 AbstractCegarLoop]: Abstraction has 2146 states and 2995 transitions. [2025-03-17 14:41:46,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2995 transitions. [2025-03-17 14:41:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-17 14:41:46,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:46,404 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:46,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:46,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:46,604 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:46,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:46,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1206974338, now seen corresponding path program 1 times [2025-03-17 14:41:46,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:46,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558289871] [2025-03-17 14:41:46,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:46,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-17 14:41:46,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-17 14:41:46,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1555 backedges. 938 proven. 0 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2025-03-17 14:41:46,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:46,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558289871] [2025-03-17 14:41:46,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558289871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:46,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:46,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:46,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482660004] [2025-03-17 14:41:46,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:46,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:46,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:46,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:46,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:46,694 INFO L87 Difference]: Start difference. First operand 2146 states and 2995 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:46,824 INFO L93 Difference]: Finished difference Result 4543 states and 6425 transitions. [2025-03-17 14:41:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:46,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 378 [2025-03-17 14:41:46,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:46,830 INFO L225 Difference]: With dead ends: 4543 [2025-03-17 14:41:46,831 INFO L226 Difference]: Without dead ends: 2410 [2025-03-17 14:41:46,833 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-03-17 14:41:46,834 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 9 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:46,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 355 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:46,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2025-03-17 14:41:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2025-03-17 14:41:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 2407 states have (on average 1.3705857914416286) internal successors, (3299), 2409 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3299 transitions. [2025-03-17 14:41:46,882 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3299 transitions. Word has length 378 [2025-03-17 14:41:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:46,883 INFO L471 AbstractCegarLoop]: Abstraction has 2410 states and 3299 transitions. [2025-03-17 14:41:46,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3299 transitions. [2025-03-17 14:41:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-17 14:41:46,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:46,888 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:46,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:41:46,889 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:46,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:46,889 INFO L85 PathProgramCache]: Analyzing trace with hash -269065778, now seen corresponding path program 1 times [2025-03-17 14:41:46,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:46,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591668931] [2025-03-17 14:41:46,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:46,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-17 14:41:46,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-17 14:41:46,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 1298 proven. 0 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2025-03-17 14:41:46,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:46,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591668931] [2025-03-17 14:41:46,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591668931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:46,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:46,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526091266] [2025-03-17 14:41:46,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:46,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:46,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:46,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:46,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:46,978 INFO L87 Difference]: Start difference. First operand 2410 states and 3299 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:47,101 INFO L93 Difference]: Finished difference Result 4947 states and 6821 transitions. [2025-03-17 14:41:47,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:47,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 438 [2025-03-17 14:41:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:47,109 INFO L225 Difference]: With dead ends: 4947 [2025-03-17 14:41:47,109 INFO L226 Difference]: Without dead ends: 2550 [2025-03-17 14:41:47,112 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-03-17 14:41:47,113 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 9 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:47,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 355 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2025-03-17 14:41:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2270. [2025-03-17 14:41:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2270 states, 2267 states have (on average 1.349360388178209) internal successors, (3059), 2269 states have internal predecessors, (3059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 3059 transitions. [2025-03-17 14:41:47,147 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 3059 transitions. Word has length 438 [2025-03-17 14:41:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:47,147 INFO L471 AbstractCegarLoop]: Abstraction has 2270 states and 3059 transitions. [2025-03-17 14:41:47,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 3059 transitions. [2025-03-17 14:41:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 14:41:47,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:47,153 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 9, 7, 7, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:47,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 14:41:47,153 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:47,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1548190836, now seen corresponding path program 1 times [2025-03-17 14:41:47,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:47,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359588862] [2025-03-17 14:41:47,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:47,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 14:41:47,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 14:41:47,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:47,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2892 backedges. 1689 proven. 0 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2025-03-17 14:41:47,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:47,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359588862] [2025-03-17 14:41:47,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359588862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:47,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:47,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:47,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006212239] [2025-03-17 14:41:47,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:47,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:47,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:47,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:47,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:47,277 INFO L87 Difference]: Start difference. First operand 2270 states and 3059 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:47,414 INFO L93 Difference]: Finished difference Result 4308 states and 5725 transitions. [2025-03-17 14:41:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:47,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 492 [2025-03-17 14:41:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:47,421 INFO L225 Difference]: With dead ends: 4308 [2025-03-17 14:41:47,421 INFO L226 Difference]: Without dead ends: 2051 [2025-03-17 14:41:47,423 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-03-17 14:41:47,425 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 31 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:47,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 344 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2025-03-17 14:41:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2045. [2025-03-17 14:41:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 2042 states have (on average 1.268364348677767) internal successors, (2590), 2044 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 2590 transitions. [2025-03-17 14:41:47,450 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 2590 transitions. Word has length 492 [2025-03-17 14:41:47,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:47,451 INFO L471 AbstractCegarLoop]: Abstraction has 2045 states and 2590 transitions. [2025-03-17 14:41:47,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:47,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2590 transitions. [2025-03-17 14:41:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-17 14:41:47,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:47,454 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:47,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 14:41:47,455 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:41:47,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:47,455 INFO L85 PathProgramCache]: Analyzing trace with hash 777514402, now seen corresponding path program 1 times [2025-03-17 14:41:47,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:47,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640921029] [2025-03-17 14:41:47,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:47,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 14:41:47,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 14:41:47,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:47,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 1526 proven. 25 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2025-03-17 14:41:47,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640921029] [2025-03-17 14:41:47,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640921029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253336923] [2025-03-17 14:41:47,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:47,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:47,618 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:47,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:41:47,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 14:41:47,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 14:41:47,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:47,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:47,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:47,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 1526 proven. 25 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2025-03-17 14:41:47,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:41:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 1526 proven. 25 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2025-03-17 14:41:47,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253336923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:41:47,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:41:47,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 14:41:47,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699095598] [2025-03-17 14:41:47,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:41:47,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:41:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:47,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:41:47,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:41:47,885 INFO L87 Difference]: Start difference. First operand 2045 states and 2590 transitions. Second operand has 8 states, 8 states have (on average 38.75) internal successors, (310), 8 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:48,229 INFO L93 Difference]: Finished difference Result 3830 states and 4961 transitions. [2025-03-17 14:41:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:41:48,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.75) internal successors, (310), 8 states have internal predecessors, (310), 0 states have call successors, (0), 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 502 [2025-03-17 14:41:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:48,230 INFO L225 Difference]: With dead ends: 3830 [2025-03-17 14:41:48,230 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:41:48,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1012 GetRequests, 1003 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:41:48,232 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 199 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:48,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 978 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:41:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:41:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:41:48,233 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-03-17 14:41:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:41:48,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 502 [2025-03-17 14:41:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:48,233 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:41:48,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.75) internal successors, (310), 8 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:41:48,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:41:48,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-17 14:41:48,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-17 14:41:48,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-17 14:41:48,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-17 14:41:48,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-17 14:41:48,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-17 14:41:48,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-17 14:41:48,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-17 14:41:48,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:48,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:48,440 INFO L422 BasicCegarLoop]: Path program 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-03-17 14:41:48,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:41:49,033 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:41:49,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:41:49 BoogieIcfgContainer [2025-03-17 14:41:49,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:41:49,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:41:49,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:41:49,055 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:41:49,055 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:39" (3/4) ... [2025-03-17 14:41:49,057 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:41:49,076 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-17 14:41:49,076 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:41:49,077 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:41:49,077 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:41:49,171 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:41:49,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:41:49,172 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:41:49,173 INFO L158 Benchmark]: Toolchain (without parser) took 10650.22ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 158.6MB in the beginning and 153.2MB in the end (delta: 5.4MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2025-03-17 14:41:49,173 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 209.7MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:41:49,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.92ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 143.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:41:49,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.32ms. Allocated memory is still 201.3MB. Free memory was 143.0MB in the beginning and 139.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:41:49,173 INFO L158 Benchmark]: Boogie Preprocessor took 52.33ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 137.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:41:49,173 INFO L158 Benchmark]: IcfgBuilder took 617.73ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 90.8MB in the end (delta: 46.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 14:41:49,174 INFO L158 Benchmark]: TraceAbstraction took 9582.36ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 90.5MB in the beginning and 164.9MB in the end (delta: -74.4MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. [2025-03-17 14:41:49,174 INFO L158 Benchmark]: Witness Printer took 117.16ms. Allocated memory is still 293.6MB. Free memory was 164.9MB in the beginning and 153.2MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:41:49,175 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.18ms. Allocated memory is still 209.7MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.92ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 143.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.32ms. Allocated memory is still 201.3MB. Free memory was 143.0MB in the beginning and 139.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.33ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 137.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 617.73ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 90.8MB in the end (delta: 46.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9582.36ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 90.5MB in the beginning and 164.9MB in the end (delta: -74.4MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. * Witness Printer took 117.16ms. Allocated memory is still 293.6MB. Free memory was 164.9MB in the beginning and 153.2MB in the end (delta: 11.7MB). 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: 512]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 512]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 512]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 512]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 272]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 272]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 274]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 274]: 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, 182 locations, 302 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 23, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2443 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2443 mSDsluCounter, 11254 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5016 mSDsCounter, 341 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3921 IncrementalHoareTripleChecker+Invalid, 4262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 341 mSolverCounterUnsat, 6238 mSDtfsCounter, 3921 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2354 GetRequests, 2310 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2958occurred in iteration=17, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 3696 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 5899 NumberOfCodeBlocks, 5899 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6107 ConstructedInterpolants, 0 QuantifiedInterpolants, 9167 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2648 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 21174/21349 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 8 specifications checked. All of them hold - InvariantResult [Line: 109]: Location Invariant Derived location invariant: ((((((((((((((((((blastFlag <= 2) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8576)) || ((blastFlag <= 2) && (s__state == 8512))) || ((blastFlag <= 2) && (8544 == s__state))) || ((blastFlag <= 2) && (8640 <= s__state))) || ((8560 == s__state) && (blastFlag <= 2))) || ((3 == blastFlag) && (8656 <= s__state))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || ((((blastFlag <= 2) && (8448 == s__state)) && (s__s3__tmp__next_state___0 == 8640)) && (0 != s__hit))) || (blastFlag < 1)) || ((((3 == blastFlag) && (8448 == s__state)) && (s__s3__tmp__next_state___0 == 8640)) && (0 != s__hit))) || (s__state == 3)) || ((((3 == blastFlag) && (s__s3__tmp__next_state___0 == 8640)) && (s__state == 8640)) && (0 != s__hit))) || ((blastFlag <= 2) && (s__state == 8608))) || ((blastFlag <= 2) && (s__state == 8592))) || ((8496 == s__state) && (blastFlag <= 2))) || ((s__state == 8528) && (blastFlag <= 2))) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:41:49,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE