./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:22:21,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:22:21,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:22:21,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:22:21,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:22:21,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:22:21,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:22:21,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:22:21,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:22:21,584 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:22:21,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:22:21,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:22:21,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:22:21,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:22:21,584 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:22:21,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:22:21,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:22:21,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:22:21,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:22:21,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:22:21,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:22:21,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:22:21,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:22:21,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:22:21,585 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:22:21,585 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:22:21,585 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:22:21,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:22:21,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:22:21,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:22:21,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:22:21,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:22:21,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:22:21,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:22:21,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:22:21,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:22:21,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:22:21,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:22:21,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:22:21,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:22:21,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:22:21,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:22:21,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:22:21,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:22:21,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:22:21,587 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2025-02-06 13:22:21,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:22:21,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:22:21,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:22:21,770 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:22:21,771 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:22:21,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2025-02-06 13:22:23,041 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5731b531/0f29f082a2d1424c9a244f45e98d21a5/FLAG0254b25df [2025-02-06 13:22:23,311 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:22:23,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2025-02-06 13:22:23,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5731b531/0f29f082a2d1424c9a244f45e98d21a5/FLAG0254b25df [2025-02-06 13:22:23,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5731b531/0f29f082a2d1424c9a244f45e98d21a5 [2025-02-06 13:22:23,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:22:23,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:22:23,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:22:23,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:22:23,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:22:23,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1998856b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23, skipping insertion in model container [2025-02-06 13:22:23,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:22:23,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:22:23,835 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:22:23,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:22:23,873 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:22:23,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23 WrapperNode [2025-02-06 13:22:23,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:22:23,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:22:23,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:22:23,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:22:23,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,904 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 646 [2025-02-06 13:22:23,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:22:23,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:22:23,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:22:23,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:22:23,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,923 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-02-06 13:22:23,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,928 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:22:23,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:22:23,934 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:22:23,934 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:22:23,935 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (1/1) ... [2025-02-06 13:22:23,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:22:23,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:23,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:22:23,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:22:23,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:22:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:22:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:22:23,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:22:24,047 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:22:24,048 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:22:24,443 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume false; [2025-02-06 13:22:24,443 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume !false; [2025-02-06 13:22:24,476 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2025-02-06 13:22:24,476 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:22:24,505 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:22:24,508 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:22:24,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:24 BoogieIcfgContainer [2025-02-06 13:22:24,508 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:22:24,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:22:24,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:22:24,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:22:24,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:22:23" (1/3) ... [2025-02-06 13:22:24,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78797c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:24, skipping insertion in model container [2025-02-06 13:22:24,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:23" (2/3) ... [2025-02-06 13:22:24,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78797c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:24, skipping insertion in model container [2025-02-06 13:22:24,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:24" (3/3) ... [2025-02-06 13:22:24,515 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2025-02-06 13:22:24,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:22:24,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_srvr_1a.BV.c.cil.c that has 1 procedures, 178 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-02-06 13:22:24,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:22:24,581 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;@1d67de75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:22:24,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 13:22:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 173 states have (on average 1.7109826589595376) internal successors, (296), 177 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 13:22:24,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:24,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:24,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:24,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash -433523520, now seen corresponding path program 1 times [2025-02-06 13:22:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:24,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366622602] [2025-02-06 13:22:24,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:24,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:24,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:22:24,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:22:24,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:24,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:24,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:24,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366622602] [2025-02-06 13:22:24,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366622602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:24,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:24,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:24,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301317793] [2025-02-06 13:22:24,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:24,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:24,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:24,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:24,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:24,864 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.7109826589595376) internal successors, (296), 177 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:25,081 INFO L93 Difference]: Finished difference Result 364 states and 606 transitions. [2025-02-06 13:22:25,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-02-06 13:22:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:25,087 INFO L225 Difference]: With dead ends: 364 [2025-02-06 13:22:25,088 INFO L226 Difference]: Without dead ends: 180 [2025-02-06 13:22:25,089 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-02-06 13:22:25,091 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 94 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:25,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 363 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:22:25,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-06 13:22:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-02-06 13:22:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 176 states have (on average 1.5625) internal successors, (275), 179 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2025-02-06 13:22:25,139 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 275 transitions. Word has length 19 [2025-02-06 13:22:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:25,139 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 275 transitions. [2025-02-06 13:22:25,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 275 transitions. [2025-02-06 13:22:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 13:22:25,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:25,140 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] [2025-02-06 13:22:25,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:22:25,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:25,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:25,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1072640571, now seen corresponding path program 1 times [2025-02-06 13:22:25,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:25,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883358404] [2025-02-06 13:22:25,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:25,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:22:25,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:22:25,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:25,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:25,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883358404] [2025-02-06 13:22:25,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883358404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:25,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:25,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:25,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791371268] [2025-02-06 13:22:25,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:25,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:25,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:25,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:25,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:25,224 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:25,338 INFO L93 Difference]: Finished difference Result 355 states and 540 transitions. [2025-02-06 13:22:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:25,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-06 13:22:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:25,340 INFO L225 Difference]: With dead ends: 355 [2025-02-06 13:22:25,340 INFO L226 Difference]: Without dead ends: 189 [2025-02-06 13:22:25,341 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-02-06 13:22:25,341 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 81 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:25,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 285 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-06 13:22:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 181. [2025-02-06 13:22:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 180 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 276 transitions. [2025-02-06 13:22:25,348 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 276 transitions. Word has length 20 [2025-02-06 13:22:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:25,348 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 276 transitions. [2025-02-06 13:22:25,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 276 transitions. [2025-02-06 13:22:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 13:22:25,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:25,349 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] [2025-02-06 13:22:25,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:22:25,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:25,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:25,354 INFO L85 PathProgramCache]: Analyzing trace with hash -812315277, now seen corresponding path program 1 times [2025-02-06 13:22:25,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:25,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699042494] [2025-02-06 13:22:25,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:25,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:25,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:22:25,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:22:25,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:25,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:25,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:25,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699042494] [2025-02-06 13:22:25,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699042494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:25,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:25,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:25,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182736009] [2025-02-06 13:22:25,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:25,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:25,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:25,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:25,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:25,415 INFO L87 Difference]: Start difference. First operand 181 states and 276 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:25,531 INFO L93 Difference]: Finished difference Result 366 states and 560 transitions. [2025-02-06 13:22:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:25,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 13:22:25,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:25,533 INFO L225 Difference]: With dead ends: 366 [2025-02-06 13:22:25,533 INFO L226 Difference]: Without dead ends: 199 [2025-02-06 13:22:25,533 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-02-06 13:22:25,534 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 36 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:25,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 362 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-06 13:22:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-06 13:22:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 195 states have (on average 1.5333333333333334) internal successors, (299), 198 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 299 transitions. [2025-02-06 13:22:25,547 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 299 transitions. Word has length 21 [2025-02-06 13:22:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:25,547 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 299 transitions. [2025-02-06 13:22:25,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 299 transitions. [2025-02-06 13:22:25,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 13:22:25,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:25,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:25,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:22:25,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:25,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:25,549 INFO L85 PathProgramCache]: Analyzing trace with hash 172424117, now seen corresponding path program 1 times [2025-02-06 13:22:25,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:25,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109995683] [2025-02-06 13:22:25,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:25,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:25,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 13:22:25,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 13:22:25,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:25,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:25,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:25,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109995683] [2025-02-06 13:22:25,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109995683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:25,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:25,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:25,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324767857] [2025-02-06 13:22:25,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:25,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:25,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:25,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:25,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:25,636 INFO L87 Difference]: Start difference. First operand 199 states and 299 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:25,765 INFO L93 Difference]: Finished difference Result 436 states and 666 transitions. [2025-02-06 13:22:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:25,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-06 13:22:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:25,766 INFO L225 Difference]: With dead ends: 436 [2025-02-06 13:22:25,767 INFO L226 Difference]: Without dead ends: 251 [2025-02-06 13:22:25,767 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-02-06 13:22:25,768 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 54 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:25,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 331 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-06 13:22:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2025-02-06 13:22:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.52863436123348) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 347 transitions. [2025-02-06 13:22:25,775 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 347 transitions. Word has length 37 [2025-02-06 13:22:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:25,775 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 347 transitions. [2025-02-06 13:22:25,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 347 transitions. [2025-02-06 13:22:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 13:22:25,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:25,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:25,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:22:25,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:25,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1738772731, now seen corresponding path program 1 times [2025-02-06 13:22:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275307205] [2025-02-06 13:22:25,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:25,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 13:22:25,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 13:22:25,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:25,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275307205] [2025-02-06 13:22:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275307205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:25,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:25,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:25,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967858074] [2025-02-06 13:22:25,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:25,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:25,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:25,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:25,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:25,843 INFO L87 Difference]: Start difference. First operand 231 states and 347 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:25,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:25,987 INFO L93 Difference]: Finished difference Result 519 states and 792 transitions. [2025-02-06 13:22:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:25,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-06 13:22:25,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:25,989 INFO L225 Difference]: With dead ends: 519 [2025-02-06 13:22:25,989 INFO L226 Difference]: Without dead ends: 280 [2025-02-06 13:22:25,989 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-02-06 13:22:25,990 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 78 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:25,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 322 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:25,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-06 13:22:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 272. [2025-02-06 13:22:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.5) internal successors, (402), 271 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 402 transitions. [2025-02-06 13:22:26,000 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 402 transitions. Word has length 38 [2025-02-06 13:22:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:26,000 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 402 transitions. [2025-02-06 13:22:26,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 402 transitions. [2025-02-06 13:22:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 13:22:26,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:26,001 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-02-06 13:22:26,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:22:26,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:26,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:26,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1085711077, now seen corresponding path program 1 times [2025-02-06 13:22:26,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:26,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723907845] [2025-02-06 13:22:26,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:26,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:26,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 13:22:26,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 13:22:26,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:26,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:22:26,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:26,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723907845] [2025-02-06 13:22:26,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723907845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:26,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:26,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:26,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856948843] [2025-02-06 13:22:26,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:26,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:26,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:26,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:26,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:26,042 INFO L87 Difference]: Start difference. First operand 272 states and 402 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:26,161 INFO L93 Difference]: Finished difference Result 581 states and 862 transitions. [2025-02-06 13:22:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:26,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-06 13:22:26,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:26,163 INFO L225 Difference]: With dead ends: 581 [2025-02-06 13:22:26,163 INFO L226 Difference]: Without dead ends: 320 [2025-02-06 13:22:26,164 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-02-06 13:22:26,164 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 78 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:26,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 292 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-02-06 13:22:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 312. [2025-02-06 13:22:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 308 states have (on average 1.5097402597402598) internal successors, (465), 311 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 465 transitions. [2025-02-06 13:22:26,172 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 465 transitions. Word has length 59 [2025-02-06 13:22:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:26,172 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 465 transitions. [2025-02-06 13:22:26,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 465 transitions. [2025-02-06 13:22:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 13:22:26,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:26,176 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 13:22:26,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:22:26,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:26,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:26,177 INFO L85 PathProgramCache]: Analyzing trace with hash 736724913, now seen corresponding path program 1 times [2025-02-06 13:22:26,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:26,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059137269] [2025-02-06 13:22:26,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:26,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:26,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 13:22:26,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 13:22:26,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:26,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:22:26,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:26,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059137269] [2025-02-06 13:22:26,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059137269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:26,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:26,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:26,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128322151] [2025-02-06 13:22:26,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:26,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:26,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:26,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:26,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:26,226 INFO L87 Difference]: Start difference. First operand 312 states and 465 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:26,346 INFO L93 Difference]: Finished difference Result 671 states and 1005 transitions. [2025-02-06 13:22:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:26,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-06 13:22:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:26,348 INFO L225 Difference]: With dead ends: 671 [2025-02-06 13:22:26,348 INFO L226 Difference]: Without dead ends: 373 [2025-02-06 13:22:26,348 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-02-06 13:22:26,349 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 36 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:26,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 375 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-06 13:22:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 360. [2025-02-06 13:22:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 356 states have (on average 1.4269662921348314) internal successors, (508), 359 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 508 transitions. [2025-02-06 13:22:26,356 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 508 transitions. Word has length 84 [2025-02-06 13:22:26,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:26,356 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 508 transitions. [2025-02-06 13:22:26,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,357 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 508 transitions. [2025-02-06 13:22:26,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 13:22:26,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:26,358 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 13:22:26,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:22:26,359 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:26,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash -287969008, now seen corresponding path program 1 times [2025-02-06 13:22:26,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:26,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702436604] [2025-02-06 13:22:26,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:26,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:26,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 13:22:26,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 13:22:26,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:26,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:22:26,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:26,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702436604] [2025-02-06 13:22:26,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702436604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:26,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:26,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:26,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352161627] [2025-02-06 13:22:26,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:26,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:26,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:26,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:26,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:26,397 INFO L87 Difference]: Start difference. First operand 360 states and 508 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:26,521 INFO L93 Difference]: Finished difference Result 729 states and 1025 transitions. [2025-02-06 13:22:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:26,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-06 13:22:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:26,523 INFO L225 Difference]: With dead ends: 729 [2025-02-06 13:22:26,523 INFO L226 Difference]: Without dead ends: 383 [2025-02-06 13:22:26,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-02-06 13:22:26,524 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 9 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:26,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 395 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-02-06 13:22:26,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2025-02-06 13:22:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 379 states have (on average 1.4142480211081794) internal successors, (536), 382 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 536 transitions. [2025-02-06 13:22:26,531 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 536 transitions. Word has length 84 [2025-02-06 13:22:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:26,531 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 536 transitions. [2025-02-06 13:22:26,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 536 transitions. [2025-02-06 13:22:26,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 13:22:26,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:26,532 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 13:22:26,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:22:26,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:26,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:26,533 INFO L85 PathProgramCache]: Analyzing trace with hash 407276216, now seen corresponding path program 1 times [2025-02-06 13:22:26,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:26,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321432242] [2025-02-06 13:22:26,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:26,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:26,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 13:22:26,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 13:22:26,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:26,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:22:26,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:26,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321432242] [2025-02-06 13:22:26,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321432242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:26,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:26,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:26,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554719151] [2025-02-06 13:22:26,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:26,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:26,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:26,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:26,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:26,587 INFO L87 Difference]: Start difference. First operand 383 states and 536 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:26,624 INFO L93 Difference]: Finished difference Result 1080 states and 1517 transitions. [2025-02-06 13:22:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:26,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-02-06 13:22:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:26,627 INFO L225 Difference]: With dead ends: 1080 [2025-02-06 13:22:26,627 INFO L226 Difference]: Without dead ends: 711 [2025-02-06 13:22:26,628 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-02-06 13:22:26,628 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 181 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:26,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 524 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-02-06 13:22:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 707. [2025-02-06 13:22:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 703 states have (on average 1.4210526315789473) internal successors, (999), 706 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 999 transitions. [2025-02-06 13:22:26,641 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 999 transitions. Word has length 99 [2025-02-06 13:22:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:26,641 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 999 transitions. [2025-02-06 13:22:26,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 999 transitions. [2025-02-06 13:22:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 13:22:26,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:26,643 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 13:22:26,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:22:26,643 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:26,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash 816100441, now seen corresponding path program 1 times [2025-02-06 13:22:26,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:26,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330616114] [2025-02-06 13:22:26,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:26,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:26,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 13:22:26,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 13:22:26,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:26,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-06 13:22:26,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:26,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330616114] [2025-02-06 13:22:26,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330616114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:26,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:26,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:26,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163686601] [2025-02-06 13:22:26,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:26,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:26,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:26,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:26,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:26,733 INFO L87 Difference]: Start difference. First operand 707 states and 999 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:26,881 INFO L93 Difference]: Finished difference Result 1420 states and 2003 transitions. [2025-02-06 13:22:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:26,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-02-06 13:22:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:26,884 INFO L225 Difference]: With dead ends: 1420 [2025-02-06 13:22:26,884 INFO L226 Difference]: Without dead ends: 726 [2025-02-06 13:22:26,885 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-02-06 13:22:26,885 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 79 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:26,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 289 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-02-06 13:22:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 710. [2025-02-06 13:22:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 706 states have (on average 1.4206798866855523) internal successors, (1003), 709 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1003 transitions. [2025-02-06 13:22:26,898 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1003 transitions. Word has length 99 [2025-02-06 13:22:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:26,899 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1003 transitions. [2025-02-06 13:22:26,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1003 transitions. [2025-02-06 13:22:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 13:22:26,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:26,900 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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-02-06 13:22:26,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:22:26,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:26,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:26,901 INFO L85 PathProgramCache]: Analyzing trace with hash 904353606, now seen corresponding path program 1 times [2025-02-06 13:22:26,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:26,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050190653] [2025-02-06 13:22:26,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:26,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 13:22:26,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 13:22:26,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:26,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-06 13:22:26,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050190653] [2025-02-06 13:22:26,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050190653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:26,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:26,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:26,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215443854] [2025-02-06 13:22:26,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:26,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:26,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:26,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:26,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:26,944 INFO L87 Difference]: Start difference. First operand 710 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:27,066 INFO L93 Difference]: Finished difference Result 1456 states and 2054 transitions. [2025-02-06 13:22:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:27,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 105 [2025-02-06 13:22:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:27,069 INFO L225 Difference]: With dead ends: 1456 [2025-02-06 13:22:27,069 INFO L226 Difference]: Without dead ends: 760 [2025-02-06 13:22:27,070 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-02-06 13:22:27,070 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 9 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:27,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 394 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-02-06 13:22:27,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2025-02-06 13:22:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 756 states have (on average 1.406084656084656) internal successors, (1063), 759 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1063 transitions. [2025-02-06 13:22:27,081 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1063 transitions. Word has length 105 [2025-02-06 13:22:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:27,082 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1063 transitions. [2025-02-06 13:22:27,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1063 transitions. [2025-02-06 13:22:27,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 13:22:27,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:27,083 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2025-02-06 13:22:27,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:22:27,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:27,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash 332992420, now seen corresponding path program 1 times [2025-02-06 13:22:27,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:27,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38837154] [2025-02-06 13:22:27,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:27,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 13:22:27,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 13:22:27,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:27,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-06 13:22:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:27,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38837154] [2025-02-06 13:22:27,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38837154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:27,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:27,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612380427] [2025-02-06 13:22:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:27,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:27,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:27,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:27,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:27,130 INFO L87 Difference]: Start difference. First operand 760 states and 1063 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-02-06 13:22:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:27,241 INFO L93 Difference]: Finished difference Result 1560 states and 2182 transitions. [2025-02-06 13:22:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:27,242 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 132 [2025-02-06 13:22:27,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:27,244 INFO L225 Difference]: With dead ends: 1560 [2025-02-06 13:22:27,245 INFO L226 Difference]: Without dead ends: 814 [2025-02-06 13:22:27,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-02-06 13:22:27,246 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 9 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:27,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 394 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:27,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-02-06 13:22:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2025-02-06 13:22:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 810 states have (on average 1.391358024691358) internal successors, (1127), 813 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1127 transitions. [2025-02-06 13:22:27,264 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1127 transitions. Word has length 132 [2025-02-06 13:22:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:27,264 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 1127 transitions. [2025-02-06 13:22:27,265 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-02-06 13:22:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1127 transitions. [2025-02-06 13:22:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 13:22:27,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:27,266 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1] [2025-02-06 13:22:27,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:22:27,266 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:27,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:27,267 INFO L85 PathProgramCache]: Analyzing trace with hash 552970051, now seen corresponding path program 1 times [2025-02-06 13:22:27,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:27,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508283789] [2025-02-06 13:22:27,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:27,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:27,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 13:22:27,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 13:22:27,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:27,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 13:22:27,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:27,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508283789] [2025-02-06 13:22:27,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508283789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:27,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:27,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:27,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646694742] [2025-02-06 13:22:27,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:27,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:27,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:27,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:27,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:27,326 INFO L87 Difference]: Start difference. First operand 814 states and 1127 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:27,453 INFO L93 Difference]: Finished difference Result 1692 states and 2342 transitions. [2025-02-06 13:22:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:27,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 134 [2025-02-06 13:22:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:27,456 INFO L225 Difference]: With dead ends: 1692 [2025-02-06 13:22:27,456 INFO L226 Difference]: Without dead ends: 892 [2025-02-06 13:22:27,457 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-02-06 13:22:27,458 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 79 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:27,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 302 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-02-06 13:22:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 842. [2025-02-06 13:22:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 838 states have (on average 1.3902147971360381) internal successors, (1165), 841 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1165 transitions. [2025-02-06 13:22:27,475 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1165 transitions. Word has length 134 [2025-02-06 13:22:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:27,476 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1165 transitions. [2025-02-06 13:22:27,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1165 transitions. [2025-02-06 13:22:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 13:22:27,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:27,478 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1] [2025-02-06 13:22:27,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:22:27,478 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:27,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1886862736, now seen corresponding path program 1 times [2025-02-06 13:22:27,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:27,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199089151] [2025-02-06 13:22:27,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:27,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 13:22:27,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 13:22:27,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:27,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 13:22:27,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:27,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199089151] [2025-02-06 13:22:27,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199089151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:27,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:27,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:27,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123559178] [2025-02-06 13:22:27,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:27,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:27,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:27,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:27,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:27,538 INFO L87 Difference]: Start difference. First operand 842 states and 1165 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:27,658 INFO L93 Difference]: Finished difference Result 1748 states and 2414 transitions. [2025-02-06 13:22:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:27,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-02-06 13:22:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:27,662 INFO L225 Difference]: With dead ends: 1748 [2025-02-06 13:22:27,662 INFO L226 Difference]: Without dead ends: 920 [2025-02-06 13:22:27,663 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-02-06 13:22:27,663 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 36 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:27,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 400 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-02-06 13:22:27,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 884. [2025-02-06 13:22:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 880 states have (on average 1.3829545454545455) internal successors, (1217), 883 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1217 transitions. [2025-02-06 13:22:27,683 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1217 transitions. Word has length 147 [2025-02-06 13:22:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:27,683 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1217 transitions. [2025-02-06 13:22:27,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1217 transitions. [2025-02-06 13:22:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 13:22:27,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:27,685 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2025-02-06 13:22:27,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:22:27,686 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:27,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1575581852, now seen corresponding path program 1 times [2025-02-06 13:22:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:27,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577303079] [2025-02-06 13:22:27,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:27,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 13:22:27,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 13:22:27,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:27,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 13:22:27,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:27,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577303079] [2025-02-06 13:22:27,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577303079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:27,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354305394] [2025-02-06 13:22:27,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:27,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:27,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:27,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:27,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:22:27,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 13:22:27,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 13:22:27,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:27,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:27,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:22:27,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 13:22:28,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 13:22:28,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354305394] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:28,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:28,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-06 13:22:28,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917843251] [2025-02-06 13:22:28,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:28,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:22:28,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:28,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:22:28,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:22:28,154 INFO L87 Difference]: Start difference. First operand 884 states and 1217 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:28,692 INFO L93 Difference]: Finished difference Result 3667 states and 5090 transitions. [2025-02-06 13:22:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:22:28,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2025-02-06 13:22:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:28,701 INFO L225 Difference]: With dead ends: 3667 [2025-02-06 13:22:28,701 INFO L226 Difference]: Without dead ends: 2727 [2025-02-06 13:22:28,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:22:28,703 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 723 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:28,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1087 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 13:22:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2025-02-06 13:22:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2390. [2025-02-06 13:22:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2386 states have (on average 1.4086336965632857) internal successors, (3361), 2389 states have internal predecessors, (3361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3361 transitions. [2025-02-06 13:22:28,750 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3361 transitions. Word has length 161 [2025-02-06 13:22:28,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:28,750 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 3361 transitions. [2025-02-06 13:22:28,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3361 transitions. [2025-02-06 13:22:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 13:22:28,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:28,752 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2025-02-06 13:22:28,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:22:28,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 13:22:28,958 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:28,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:28,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1181255447, now seen corresponding path program 1 times [2025-02-06 13:22:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:28,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853698889] [2025-02-06 13:22:28,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:28,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:28,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 13:22:28,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 13:22:28,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:28,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 13:22:29,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:29,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853698889] [2025-02-06 13:22:29,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853698889] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:29,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140369708] [2025-02-06 13:22:29,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:29,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:29,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:29,082 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:29,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:22:29,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 13:22:29,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 13:22:29,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:29,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:29,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:22:29,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 13:22:29,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 13:22:29,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140369708] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:29,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:29,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-06 13:22:29,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171927563] [2025-02-06 13:22:29,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:29,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:22:29,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:29,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:22:29,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:22:29,278 INFO L87 Difference]: Start difference. First operand 2390 states and 3361 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:29,826 INFO L93 Difference]: Finished difference Result 6793 states and 9394 transitions. [2025-02-06 13:22:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:22:29,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 163 [2025-02-06 13:22:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:29,841 INFO L225 Difference]: With dead ends: 6793 [2025-02-06 13:22:29,841 INFO L226 Difference]: Without dead ends: 4417 [2025-02-06 13:22:29,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:22:29,845 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 631 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:29,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1434 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 13:22:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states. [2025-02-06 13:22:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 3840. [2025-02-06 13:22:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3840 states, 3836 states have (on average 1.3647028154327425) internal successors, (5235), 3839 states have internal predecessors, (5235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 5235 transitions. [2025-02-06 13:22:29,945 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 5235 transitions. Word has length 163 [2025-02-06 13:22:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:29,945 INFO L471 AbstractCegarLoop]: Abstraction has 3840 states and 5235 transitions. [2025-02-06 13:22:29,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 5235 transitions. [2025-02-06 13:22:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-06 13:22:29,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:29,948 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 13:22:29,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:22:30,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 13:22:30,152 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:30,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:30,153 INFO L85 PathProgramCache]: Analyzing trace with hash -357202535, now seen corresponding path program 1 times [2025-02-06 13:22:30,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:30,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625719499] [2025-02-06 13:22:30,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:30,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:30,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 13:22:30,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 13:22:30,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:30,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-06 13:22:30,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:30,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625719499] [2025-02-06 13:22:30,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625719499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:30,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:30,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:30,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399234928] [2025-02-06 13:22:30,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:30,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:30,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:30,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:30,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:30,206 INFO L87 Difference]: Start difference. First operand 3840 states and 5235 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:30,281 INFO L93 Difference]: Finished difference Result 9958 states and 13588 transitions. [2025-02-06 13:22:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:30,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 170 [2025-02-06 13:22:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:30,298 INFO L225 Difference]: With dead ends: 9958 [2025-02-06 13:22:30,298 INFO L226 Difference]: Without dead ends: 6132 [2025-02-06 13:22:30,303 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-02-06 13:22:30,304 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 175 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:30,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 647 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2025-02-06 13:22:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 5672. [2025-02-06 13:22:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5672 states, 5668 states have (on average 1.3720889202540578) internal successors, (7777), 5671 states have internal predecessors, (7777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5672 states to 5672 states and 7777 transitions. [2025-02-06 13:22:30,401 INFO L78 Accepts]: Start accepts. Automaton has 5672 states and 7777 transitions. Word has length 170 [2025-02-06 13:22:30,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:30,402 INFO L471 AbstractCegarLoop]: Abstraction has 5672 states and 7777 transitions. [2025-02-06 13:22:30,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:30,402 INFO L276 IsEmpty]: Start isEmpty. Operand 5672 states and 7777 transitions. [2025-02-06 13:22:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-06 13:22:30,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:30,404 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 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, 1, 1] [2025-02-06 13:22:30,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 13:22:30,405 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:30,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:30,405 INFO L85 PathProgramCache]: Analyzing trace with hash 989420787, now seen corresponding path program 1 times [2025-02-06 13:22:30,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:30,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049796492] [2025-02-06 13:22:30,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:30,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:30,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 13:22:30,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 13:22:30,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:30,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-02-06 13:22:30,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:30,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049796492] [2025-02-06 13:22:30,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049796492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:30,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:30,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166635650] [2025-02-06 13:22:30,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:30,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:30,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:30,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:30,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:30,453 INFO L87 Difference]: Start difference. First operand 5672 states and 7777 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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-02-06 13:22:30,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:30,611 INFO L93 Difference]: Finished difference Result 9680 states and 13187 transitions. [2025-02-06 13:22:30,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:30,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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 172 [2025-02-06 13:22:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:30,622 INFO L225 Difference]: With dead ends: 9680 [2025-02-06 13:22:30,623 INFO L226 Difference]: Without dead ends: 4022 [2025-02-06 13:22:30,628 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-02-06 13:22:30,629 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 9 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:30,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 381 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2025-02-06 13:22:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 2789. [2025-02-06 13:22:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2787 states have (on average 1.326157158234661) internal successors, (3696), 2788 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3696 transitions. [2025-02-06 13:22:30,686 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3696 transitions. Word has length 172 [2025-02-06 13:22:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:30,686 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 3696 transitions. [2025-02-06 13:22:30,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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-02-06 13:22:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3696 transitions. [2025-02-06 13:22:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 13:22:30,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:30,688 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:30,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 13:22:30,689 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:30,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -270921796, now seen corresponding path program 1 times [2025-02-06 13:22:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:30,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393185756] [2025-02-06 13:22:30,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:30,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 13:22:30,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 13:22:30,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:30,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-02-06 13:22:30,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:30,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393185756] [2025-02-06 13:22:30,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393185756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:30,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:30,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934123773] [2025-02-06 13:22:30,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:30,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:30,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:30,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:30,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:30,768 INFO L87 Difference]: Start difference. First operand 2789 states and 3696 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:30,885 INFO L93 Difference]: Finished difference Result 5046 states and 6654 transitions. [2025-02-06 13:22:30,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 206 [2025-02-06 13:22:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:30,897 INFO L225 Difference]: With dead ends: 5046 [2025-02-06 13:22:30,897 INFO L226 Difference]: Without dead ends: 2271 [2025-02-06 13:22:30,903 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-02-06 13:22:30,903 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 62 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:30,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 331 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2025-02-06 13:22:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 2262. [2025-02-06 13:22:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2262 states, 2260 states have (on average 1.2986725663716814) internal successors, (2935), 2261 states have internal predecessors, (2935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2935 transitions. [2025-02-06 13:22:30,937 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2935 transitions. Word has length 206 [2025-02-06 13:22:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:30,938 INFO L471 AbstractCegarLoop]: Abstraction has 2262 states and 2935 transitions. [2025-02-06 13:22:30,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2935 transitions. [2025-02-06 13:22:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-06 13:22:30,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:30,941 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:30,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 13:22:30,941 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:30,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1004020501, now seen corresponding path program 1 times [2025-02-06 13:22:30,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:30,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496347568] [2025-02-06 13:22:30,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:30,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:30,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 13:22:30,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 13:22:30,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:30,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-06 13:22:31,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:31,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496347568] [2025-02-06 13:22:31,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496347568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:31,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:31,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:31,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185691805] [2025-02-06 13:22:31,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:31,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:31,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:31,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:31,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:31,011 INFO L87 Difference]: Start difference. First operand 2262 states and 2935 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:31,149 INFO L93 Difference]: Finished difference Result 3888 states and 4996 transitions. [2025-02-06 13:22:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:31,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2025-02-06 13:22:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:31,155 INFO L225 Difference]: With dead ends: 3888 [2025-02-06 13:22:31,155 INFO L226 Difference]: Without dead ends: 1099 [2025-02-06 13:22:31,157 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-02-06 13:22:31,158 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:31,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 382 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-06 13:22:31,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1087. [2025-02-06 13:22:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1085 states have (on average 1.2866359447004607) internal successors, (1396), 1086 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1396 transitions. [2025-02-06 13:22:31,183 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1396 transitions. Word has length 208 [2025-02-06 13:22:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:31,184 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1396 transitions. [2025-02-06 13:22:31,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1396 transitions. [2025-02-06 13:22:31,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-06 13:22:31,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:31,188 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 13:22:31,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 13:22:31,188 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:31,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:31,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1365348076, now seen corresponding path program 1 times [2025-02-06 13:22:31,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:31,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614785298] [2025-02-06 13:22:31,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:31,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:31,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-06 13:22:31,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-06 13:22:31,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:31,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2025-02-06 13:22:31,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:31,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614785298] [2025-02-06 13:22:31,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614785298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:31,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:31,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:31,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049851585] [2025-02-06 13:22:31,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:31,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:31,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:31,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:31,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:31,277 INFO L87 Difference]: Start difference. First operand 1087 states and 1396 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:31,389 INFO L93 Difference]: Finished difference Result 2296 states and 2938 transitions. [2025-02-06 13:22:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:31,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 306 [2025-02-06 13:22:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:31,392 INFO L225 Difference]: With dead ends: 2296 [2025-02-06 13:22:31,392 INFO L226 Difference]: Without dead ends: 1223 [2025-02-06 13:22:31,394 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-02-06 13:22:31,395 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:31,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 371 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-02-06 13:22:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2025-02-06 13:22:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1221 states have (on average 1.2710892710892712) internal successors, (1552), 1222 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1552 transitions. [2025-02-06 13:22:31,422 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1552 transitions. Word has length 306 [2025-02-06 13:22:31,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:31,423 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1552 transitions. [2025-02-06 13:22:31,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1552 transitions. [2025-02-06 13:22:31,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-02-06 13:22:31,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:31,428 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:31,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 13:22:31,428 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:31,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:31,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1410756410, now seen corresponding path program 1 times [2025-02-06 13:22:31,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:31,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267637413] [2025-02-06 13:22:31,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:31,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:31,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-06 13:22:31,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-06 13:22:31,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:31,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-02-06 13:22:31,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:31,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267637413] [2025-02-06 13:22:31,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267637413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:31,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:31,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:31,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295462480] [2025-02-06 13:22:31,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:31,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:31,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:31,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:31,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:31,494 INFO L87 Difference]: Start difference. First operand 1223 states and 1552 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:31,599 INFO L93 Difference]: Finished difference Result 2576 states and 3266 transitions. [2025-02-06 13:22:31,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:31,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 337 [2025-02-06 13:22:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:31,606 INFO L225 Difference]: With dead ends: 2576 [2025-02-06 13:22:31,606 INFO L226 Difference]: Without dead ends: 1367 [2025-02-06 13:22:31,608 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-02-06 13:22:31,612 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:31,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 371 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:31,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-02-06 13:22:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1367. [2025-02-06 13:22:31,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1365 states have (on average 1.2571428571428571) internal successors, (1716), 1366 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1716 transitions. [2025-02-06 13:22:31,628 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1716 transitions. Word has length 337 [2025-02-06 13:22:31,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:31,628 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1716 transitions. [2025-02-06 13:22:31,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:31,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1716 transitions. [2025-02-06 13:22:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-02-06 13:22:31,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:31,632 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:31,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 13:22:31,632 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:31,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:31,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1933930638, now seen corresponding path program 1 times [2025-02-06 13:22:31,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:31,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001902866] [2025-02-06 13:22:31,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:31,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:31,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-02-06 13:22:31,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-02-06 13:22:31,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:31,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 721 proven. 0 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-02-06 13:22:31,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:31,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001902866] [2025-02-06 13:22:31,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001902866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:31,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:31,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:31,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770792362] [2025-02-06 13:22:31,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:31,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:31,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:31,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:31,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:31,698 INFO L87 Difference]: Start difference. First operand 1367 states and 1716 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:31,805 INFO L93 Difference]: Finished difference Result 2718 states and 3406 transitions. [2025-02-06 13:22:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:31,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 370 [2025-02-06 13:22:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:31,808 INFO L225 Difference]: With dead ends: 2718 [2025-02-06 13:22:31,808 INFO L226 Difference]: Without dead ends: 1365 [2025-02-06 13:22:31,809 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-02-06 13:22:31,810 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 367 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-02-06 13:22:31,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 367 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-02-06 13:22:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1141. [2025-02-06 13:22:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1139 states have (on average 1.257243195785777) internal successors, (1432), 1140 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1432 transitions. [2025-02-06 13:22:31,825 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1432 transitions. Word has length 370 [2025-02-06 13:22:31,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:31,825 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1432 transitions. [2025-02-06 13:22:31,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:31,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1432 transitions. [2025-02-06 13:22:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-06 13:22:31,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:31,829 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:31,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 13:22:31,829 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:22:31,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:31,830 INFO L85 PathProgramCache]: Analyzing trace with hash -668059901, now seen corresponding path program 1 times [2025-02-06 13:22:31,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:31,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590647788] [2025-02-06 13:22:31,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:31,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:31,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 13:22:31,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 13:22:31,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:31,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2025-02-06 13:22:31,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:31,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590647788] [2025-02-06 13:22:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590647788] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:31,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203977965] [2025-02-06 13:22:31,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:31,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:31,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:31,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:31,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:22:32,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 13:22:32,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 13:22:32,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:32,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:32,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:22:32,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2025-02-06 13:22:32,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2025-02-06 13:22:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203977965] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:32,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:32,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-06 13:22:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297628439] [2025-02-06 13:22:32,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:32,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:22:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:32,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:22:32,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:22:32,221 INFO L87 Difference]: Start difference. First operand 1141 states and 1432 transitions. Second operand has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:32,363 INFO L93 Difference]: Finished difference Result 2133 states and 2654 transitions. [2025-02-06 13:22:32,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:22:32,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 0 states have call successors, (0), 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 408 [2025-02-06 13:22:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:32,365 INFO L225 Difference]: With dead ends: 2133 [2025-02-06 13:22:32,365 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:22:32,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:22:32,367 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 101 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:32,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 949 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:22:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:22:32,368 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-02-06 13:22:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:22:32,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 408 [2025-02-06 13:22:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:32,368 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:22:32,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:22:32,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:22:32,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-06 13:22:32,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-06 13:22:32,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-06 13:22:32,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-06 13:22:32,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:22:32,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:32,577 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, 1] [2025-02-06 13:22:32,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:22:33,558 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:22:33,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:22:33 BoogieIcfgContainer [2025-02-06 13:22:33,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:22:33,579 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:22:33,579 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:22:33,579 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:22:33,580 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:24" (3/4) ... [2025-02-06 13:22:33,581 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:22:33,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-06 13:22:33,592 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:22:33,592 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 13:22:33,593 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:22:33,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:22:33,686 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:22:33,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:22:33,687 INFO L158 Benchmark]: Toolchain (without parser) took 10066.81ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 124.2MB in the beginning and 362.4MB in the end (delta: -238.2MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2025-02-06 13:22:33,691 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 226.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:22:33,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.00ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 108.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:22:33,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.19ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:22:33,691 INFO L158 Benchmark]: Boogie Preprocessor took 28.28ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 103.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:22:33,691 INFO L158 Benchmark]: IcfgBuilder took 574.57ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 60.5MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 13:22:33,691 INFO L158 Benchmark]: TraceAbstraction took 9068.51ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 59.6MB in the beginning and 370.7MB in the end (delta: -311.1MB). Peak memory consumption was 190.3MB. Max. memory is 16.1GB. [2025-02-06 13:22:33,691 INFO L158 Benchmark]: Witness Printer took 106.64ms. Allocated memory is still 436.2MB. Free memory was 370.7MB in the beginning and 362.4MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:22:33,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 226.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.00ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 108.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.19ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.28ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 103.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 574.57ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 60.5MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9068.51ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 59.6MB in the beginning and 370.7MB in the end (delta: -311.1MB). Peak memory consumption was 190.3MB. Max. memory is 16.1GB. * Witness Printer took 106.64ms. Allocated memory is still 436.2MB. Free memory was 370.7MB in the beginning and 362.4MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 268]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 268]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 270]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 270]: 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, 178 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 24, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2615 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2615 mSDsluCounter, 11348 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5436 mSDsCounter, 421 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4387 IncrementalHoareTripleChecker+Invalid, 4808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 421 mSolverCounterUnsat, 5912 mSDtfsCounter, 4387 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1551 GetRequests, 1507 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5672occurred in iteration=17, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 3015 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 4311 NumberOfCodeBlocks, 4311 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 5013 ConstructedInterpolants, 0 QuantifiedInterpolants, 6607 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1327 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 30 InterpolantComputations, 21 PerfectInterpolantSequences, 12588/12645 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 4 specifications checked. All of them hold - InvariantResult [Line: 109]: Location Invariant Derived location invariant: (((((((((((((((((s__state == 8528) || ((s__s3__tmp__next_state___0 <= 8576) && (s__state == 8640))) || (8496 == s__state)) || ((8576 == s__s3__tmp__next_state___0) && (8576 == s__state))) || ((s__state == 8592) && (s__s3__tmp__next_state___0 <= 8576))) || (8560 == s__state)) || ((s__state == 8608) && (s__s3__tmp__next_state___0 <= 8576))) || (((((s__state <= 12291) && (8576 <= s__s3__tmp__next_state___0)) && (0 != s__hit)) && (8576 <= s__state)) && (s__s3__tmp__next_state___0 <= 12291))) || (((8576 == s__s3__tmp__next_state___0) && (s__state <= 8466)) && (8448 <= s__state))) || (s__state == 8512)) || ((s__state == 3) && (s__s3__tmp__next_state___0 <= 8576))) || (((((s__state <= 8466) && (8576 <= s__s3__tmp__next_state___0)) && (8448 <= s__state)) && (0 != s__hit)) && (s__s3__tmp__next_state___0 <= 12291))) || (8464 == s__state)) || ((3 == s__s3__tmp__next_state___0) && (8448 == s__state))) || (((s__state == 3) && (0 != s__hit)) && (s__s3__tmp__next_state___0 <= 12291))) || ((8656 <= s__state) && (s__state <= 8672))) || (8544 == s__state)) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:22:33,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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