./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/kundu1.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/systemc/kundu1.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 c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:36:59,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:36:59,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:36:59,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:36:59,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:36:59,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:36:59,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:36:59,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:36:59,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:36:59,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:36:59,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:36:59,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:36:59,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:36:59,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:36:59,627 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:36:59,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:36:59,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:36:59,627 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:36:59,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:36:59,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:36:59,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:36:59,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:36:59,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:36:59,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:36:59,628 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:36:59,628 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:36:59,628 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:36:59,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:36:59,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:36:59,629 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:36:59,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:36:59,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:36:59,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:36:59,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:36:59,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:36:59,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:36:59,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:36:59,630 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:36:59,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:36:59,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:36:59,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:36:59,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:36:59,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:36:59,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:36:59,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:36:59,630 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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2025-02-06 14:36:59,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:36:59,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:36:59,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:36:59,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:36:59,882 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:36:59,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2025-02-06 14:37:01,058 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b7812328/6f1ea21a0ec940309be90d697176b6ad/FLAG25e58873c [2025-02-06 14:37:01,283 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:37:01,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2025-02-06 14:37:01,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b7812328/6f1ea21a0ec940309be90d697176b6ad/FLAG25e58873c [2025-02-06 14:37:01,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b7812328/6f1ea21a0ec940309be90d697176b6ad [2025-02-06 14:37:01,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:37:01,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:37:01,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:37:01,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:37:01,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:37:01,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a36a757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01, skipping insertion in model container [2025-02-06 14:37:01,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:37:01,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:37:01,473 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:37:01,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:37:01,528 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:37:01,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01 WrapperNode [2025-02-06 14:37:01,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:37:01,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:37:01,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:37:01,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:37:01,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,560 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 259 [2025-02-06 14:37:01,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:37:01,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:37:01,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:37:01,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:37:01,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,584 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 14:37:01,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:37:01,590 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:37:01,590 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:37:01,590 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:37:01,591 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (1/1) ... [2025-02-06 14:37:01,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:37:01,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:01,626 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 14:37:01,634 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 14:37:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:37:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-06 14:37:01,652 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-06 14:37:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-06 14:37:01,653 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-06 14:37:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-06 14:37:01,653 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-06 14:37:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-06 14:37:01,653 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-06 14:37:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-06 14:37:01,653 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-06 14:37:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:37:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-06 14:37:01,654 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-06 14:37:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:37:01,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:37:01,703 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:37:01,705 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:37:01,958 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-02-06 14:37:01,958 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:37:01,966 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:37:01,966 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:37:01,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:01 BoogieIcfgContainer [2025-02-06 14:37:01,966 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:37:01,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:37:01,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:37:01,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:37:01,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:37:01" (1/3) ... [2025-02-06 14:37:01,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a393884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:37:01, skipping insertion in model container [2025-02-06 14:37:01,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:01" (2/3) ... [2025-02-06 14:37:01,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a393884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:37:01, skipping insertion in model container [2025-02-06 14:37:01,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:01" (3/3) ... [2025-02-06 14:37:01,973 INFO L128 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2025-02-06 14:37:01,983 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:37:01,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG kundu1.cil.c that has 7 procedures, 127 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-02-06 14:37:02,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:37:02,035 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;@72fe57fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:37:02,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 14:37:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 109 states have internal predecessors, (142), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 14:37:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 14:37:02,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:02,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:02,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:02,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:02,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1830220166, now seen corresponding path program 1 times [2025-02-06 14:37:02,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:02,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660154295] [2025-02-06 14:37:02,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:02,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:02,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 14:37:02,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 14:37:02,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:02,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:02,309 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 14:37:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:02,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660154295] [2025-02-06 14:37:02,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660154295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:02,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:02,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:37:02,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847150613] [2025-02-06 14:37:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:02,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:37:02,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:02,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:37:02,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:02,335 INFO L87 Difference]: Start difference. First operand has 128 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 109 states have internal predecessors, (142), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:02,501 INFO L93 Difference]: Finished difference Result 351 states and 477 transitions. [2025-02-06 14:37:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:37:02,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2025-02-06 14:37:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:02,510 INFO L225 Difference]: With dead ends: 351 [2025-02-06 14:37:02,511 INFO L226 Difference]: Without dead ends: 215 [2025-02-06 14:37:02,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:02,518 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 275 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:02,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 536 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-06 14:37:02,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 201. [2025-02-06 14:37:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 163 states have (on average 1.392638036809816) internal successors, (227), 171 states have internal predecessors, (227), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 14:37:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 267 transitions. [2025-02-06 14:37:02,577 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 267 transitions. Word has length 48 [2025-02-06 14:37:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:02,577 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 267 transitions. [2025-02-06 14:37:02,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:02,577 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 267 transitions. [2025-02-06 14:37:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 14:37:02,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:02,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:02,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:37:02,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:02,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash 6310589, now seen corresponding path program 1 times [2025-02-06 14:37:02,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:02,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510291099] [2025-02-06 14:37:02,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:02,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 14:37:02,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 14:37:02,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:02,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:02,643 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 14:37:02,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:02,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510291099] [2025-02-06 14:37:02,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510291099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:02,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:02,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:02,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360569968] [2025-02-06 14:37:02,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:02,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:37:02,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:02,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:37:02,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:02,646 INFO L87 Difference]: Start difference. First operand 201 states and 267 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:02,690 INFO L93 Difference]: Finished difference Result 395 states and 528 transitions. [2025-02-06 14:37:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:37:02,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2025-02-06 14:37:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:02,692 INFO L225 Difference]: With dead ends: 395 [2025-02-06 14:37:02,692 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 14:37:02,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:02,693 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:02,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 14:37:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-06 14:37:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 166 states have (on average 1.3795180722891567) internal successors, (229), 174 states have internal predecessors, (229), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 14:37:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 269 transitions. [2025-02-06 14:37:02,705 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 269 transitions. Word has length 48 [2025-02-06 14:37:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:02,705 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 269 transitions. [2025-02-06 14:37:02,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 269 transitions. [2025-02-06 14:37:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 14:37:02,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:02,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:02,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:37:02,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:02,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash 699412286, now seen corresponding path program 1 times [2025-02-06 14:37:02,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:02,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168639475] [2025-02-06 14:37:02,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:02,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:02,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 14:37:02,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 14:37:02,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:02,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:02,793 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 14:37:02,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:02,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168639475] [2025-02-06 14:37:02,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168639475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:02,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:02,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:02,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977039571] [2025-02-06 14:37:02,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:02,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:37:02,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:02,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:37:02,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:02,795 INFO L87 Difference]: Start difference. First operand 204 states and 269 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:03,018 INFO L93 Difference]: Finished difference Result 791 states and 1035 transitions. [2025-02-06 14:37:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:37:03,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2025-02-06 14:37:03,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:03,022 INFO L225 Difference]: With dead ends: 791 [2025-02-06 14:37:03,022 INFO L226 Difference]: Without dead ends: 569 [2025-02-06 14:37:03,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:03,024 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 563 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:03,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 630 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:37:03,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-02-06 14:37:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 446. [2025-02-06 14:37:03,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 373 states have (on average 1.3699731903485255) internal successors, (511), 380 states have internal predecessors, (511), 41 states have call successors, (41), 23 states have call predecessors, (41), 24 states have return successors, (43), 43 states have call predecessors, (43), 41 states have call successors, (43) [2025-02-06 14:37:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 595 transitions. [2025-02-06 14:37:03,052 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 595 transitions. Word has length 48 [2025-02-06 14:37:03,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:03,052 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 595 transitions. [2025-02-06 14:37:03,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 595 transitions. [2025-02-06 14:37:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 14:37:03,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:03,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:03,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:37:03,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:03,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:03,054 INFO L85 PathProgramCache]: Analyzing trace with hash 137574691, now seen corresponding path program 1 times [2025-02-06 14:37:03,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:03,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797085646] [2025-02-06 14:37:03,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:03,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:03,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 14:37:03,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 14:37:03,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:03,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:03,091 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 14:37:03,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:03,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797085646] [2025-02-06 14:37:03,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797085646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:03,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:03,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:37:03,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514715672] [2025-02-06 14:37:03,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:03,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:37:03,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:03,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:37:03,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:03,093 INFO L87 Difference]: Start difference. First operand 446 states and 595 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:03,192 INFO L93 Difference]: Finished difference Result 1109 states and 1475 transitions. [2025-02-06 14:37:03,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:37:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2025-02-06 14:37:03,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:03,195 INFO L225 Difference]: With dead ends: 1109 [2025-02-06 14:37:03,195 INFO L226 Difference]: Without dead ends: 673 [2025-02-06 14:37:03,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:03,197 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 218 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:03,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 625 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-02-06 14:37:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 573. [2025-02-06 14:37:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 470 states have (on average 1.304255319148936) internal successors, (613), 478 states have internal predecessors, (613), 60 states have call successors, (60), 35 states have call predecessors, (60), 35 states have return successors, (64), 60 states have call predecessors, (64), 60 states have call successors, (64) [2025-02-06 14:37:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 737 transitions. [2025-02-06 14:37:03,246 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 737 transitions. Word has length 51 [2025-02-06 14:37:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:03,246 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 737 transitions. [2025-02-06 14:37:03,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 737 transitions. [2025-02-06 14:37:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 14:37:03,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:03,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:03,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:37:03,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:03,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:03,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1340149478, now seen corresponding path program 1 times [2025-02-06 14:37:03,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:03,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657739477] [2025-02-06 14:37:03,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:03,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:03,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 14:37:03,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 14:37:03,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:03,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:03,314 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 14:37:03,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:03,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657739477] [2025-02-06 14:37:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657739477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:03,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295106341] [2025-02-06 14:37:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:03,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:37:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:03,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:37:03,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:03,316 INFO L87 Difference]: Start difference. First operand 573 states and 737 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:03,350 INFO L93 Difference]: Finished difference Result 1148 states and 1494 transitions. [2025-02-06 14:37:03,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:37:03,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2025-02-06 14:37:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:03,353 INFO L225 Difference]: With dead ends: 1148 [2025-02-06 14:37:03,353 INFO L226 Difference]: Without dead ends: 585 [2025-02-06 14:37:03,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:03,355 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:03,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 585 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-02-06 14:37:03,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2025-02-06 14:37:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 482 states have (on average 1.2904564315352698) internal successors, (622), 490 states have internal predecessors, (622), 60 states have call successors, (60), 35 states have call predecessors, (60), 35 states have return successors, (64), 60 states have call predecessors, (64), 60 states have call successors, (64) [2025-02-06 14:37:03,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 746 transitions. [2025-02-06 14:37:03,381 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 746 transitions. Word has length 51 [2025-02-06 14:37:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:03,381 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 746 transitions. [2025-02-06 14:37:03,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 746 transitions. [2025-02-06 14:37:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 14:37:03,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:03,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:03,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:37:03,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:03,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:03,383 INFO L85 PathProgramCache]: Analyzing trace with hash -737059865, now seen corresponding path program 1 times [2025-02-06 14:37:03,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:03,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049739920] [2025-02-06 14:37:03,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:03,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:03,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 14:37:03,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 14:37:03,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:03,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:03,450 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 14:37:03,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:03,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049739920] [2025-02-06 14:37:03,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049739920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:03,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:03,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:37:03,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808199765] [2025-02-06 14:37:03,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:03,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:37:03,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:03,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:37:03,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:03,451 INFO L87 Difference]: Start difference. First operand 585 states and 746 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:03,598 INFO L93 Difference]: Finished difference Result 1701 states and 2201 transitions. [2025-02-06 14:37:03,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:37:03,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2025-02-06 14:37:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:03,602 INFO L225 Difference]: With dead ends: 1701 [2025-02-06 14:37:03,602 INFO L226 Difference]: Without dead ends: 1127 [2025-02-06 14:37:03,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:03,603 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 159 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:03,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 346 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-02-06 14:37:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1121. [2025-02-06 14:37:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 921 states have (on average 1.261672095548317) internal successors, (1162), 933 states have internal predecessors, (1162), 119 states have call successors, (119), 70 states have call predecessors, (119), 73 states have return successors, (156), 119 states have call predecessors, (156), 119 states have call successors, (156) [2025-02-06 14:37:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1437 transitions. [2025-02-06 14:37:03,653 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1437 transitions. Word has length 51 [2025-02-06 14:37:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:03,653 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1437 transitions. [2025-02-06 14:37:03,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1437 transitions. [2025-02-06 14:37:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 14:37:03,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:03,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:03,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:37:03,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:03,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1813123661, now seen corresponding path program 1 times [2025-02-06 14:37:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:03,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778979191] [2025-02-06 14:37:03,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:03,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:03,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 14:37:03,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 14:37:03,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:03,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:03,702 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 14:37:03,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778979191] [2025-02-06 14:37:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778979191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:03,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:37:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819264911] [2025-02-06 14:37:03,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:03,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:03,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:03,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:03,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:03,703 INFO L87 Difference]: Start difference. First operand 1121 states and 1437 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 14:37:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:03,782 INFO L93 Difference]: Finished difference Result 1773 states and 2267 transitions. [2025-02-06 14:37:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:03,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2025-02-06 14:37:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:03,790 INFO L225 Difference]: With dead ends: 1773 [2025-02-06 14:37:03,791 INFO L226 Difference]: Without dead ends: 1769 [2025-02-06 14:37:03,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:03,792 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 109 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:03,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 270 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:03,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2025-02-06 14:37:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1765. [2025-02-06 14:37:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1458 states have (on average 1.2496570644718792) internal successors, (1822), 1473 states have internal predecessors, (1822), 183 states have call successors, (183), 110 states have call predecessors, (183), 116 states have return successors, (244), 183 states have call predecessors, (244), 183 states have call successors, (244) [2025-02-06 14:37:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2249 transitions. [2025-02-06 14:37:03,899 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2249 transitions. Word has length 52 [2025-02-06 14:37:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:03,899 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2249 transitions. [2025-02-06 14:37:03,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 14:37:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2249 transitions. [2025-02-06 14:37:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 14:37:03,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:03,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:03,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 14:37:03,900 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:03,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1275042773, now seen corresponding path program 1 times [2025-02-06 14:37:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113866299] [2025-02-06 14:37:03,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:03,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 14:37:03,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 14:37:03,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:03,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:03,946 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 14:37:03,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:03,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113866299] [2025-02-06 14:37:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113866299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:03,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:37:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407655581] [2025-02-06 14:37:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:03,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:03,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:03,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:03,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:03,947 INFO L87 Difference]: Start difference. First operand 1765 states and 2249 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 14:37:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:04,039 INFO L93 Difference]: Finished difference Result 1942 states and 2469 transitions. [2025-02-06 14:37:04,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2025-02-06 14:37:04,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:04,047 INFO L225 Difference]: With dead ends: 1942 [2025-02-06 14:37:04,047 INFO L226 Difference]: Without dead ends: 1940 [2025-02-06 14:37:04,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:04,051 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 95 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:04,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 295 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2025-02-06 14:37:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1938. [2025-02-06 14:37:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1604 states have (on average 1.2450124688279303) internal successors, (1997), 1620 states have internal predecessors, (1997), 199 states have call successors, (199), 120 states have call predecessors, (199), 127 states have return successors, (265), 199 states have call predecessors, (265), 199 states have call successors, (265) [2025-02-06 14:37:04,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2461 transitions. [2025-02-06 14:37:04,133 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2461 transitions. Word has length 52 [2025-02-06 14:37:04,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:04,134 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 2461 transitions. [2025-02-06 14:37:04,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 14:37:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2461 transitions. [2025-02-06 14:37:04,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 14:37:04,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:04,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:04,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 14:37:04,138 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:04,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:04,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1312416851, now seen corresponding path program 1 times [2025-02-06 14:37:04,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:04,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609181058] [2025-02-06 14:37:04,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:04,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:04,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 14:37:04,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 14:37:04,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:04,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 14:37:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:04,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609181058] [2025-02-06 14:37:04,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609181058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:04,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:04,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:04,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999946899] [2025-02-06 14:37:04,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:04,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:37:04,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:04,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:37:04,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:04,221 INFO L87 Difference]: Start difference. First operand 1938 states and 2461 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 14:37:04,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:04,490 INFO L93 Difference]: Finished difference Result 4567 states and 5877 transitions. [2025-02-06 14:37:04,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:37:04,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2025-02-06 14:37:04,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:04,503 INFO L225 Difference]: With dead ends: 4567 [2025-02-06 14:37:04,504 INFO L226 Difference]: Without dead ends: 2645 [2025-02-06 14:37:04,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:04,509 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 571 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:04,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 645 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2025-02-06 14:37:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 2607. [2025-02-06 14:37:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2607 states, 2134 states have (on average 1.218369259606373) internal successors, (2600), 2155 states have internal predecessors, (2600), 285 states have call successors, (285), 170 states have call predecessors, (285), 180 states have return successors, (403), 285 states have call predecessors, (403), 285 states have call successors, (403) [2025-02-06 14:37:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3288 transitions. [2025-02-06 14:37:04,635 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3288 transitions. Word has length 72 [2025-02-06 14:37:04,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:04,635 INFO L471 AbstractCegarLoop]: Abstraction has 2607 states and 3288 transitions. [2025-02-06 14:37:04,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 14:37:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3288 transitions. [2025-02-06 14:37:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 14:37:04,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:04,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:04,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 14:37:04,637 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:04,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2058291543, now seen corresponding path program 1 times [2025-02-06 14:37:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:04,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851027738] [2025-02-06 14:37:04,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:04,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:04,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 14:37:04,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 14:37:04,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:04,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 14:37:04,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:04,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851027738] [2025-02-06 14:37:04,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851027738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:04,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:04,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:37:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316009377] [2025-02-06 14:37:04,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:04,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:37:04,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:04,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:37:04,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:04,708 INFO L87 Difference]: Start difference. First operand 2607 states and 3288 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 14:37:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:04,866 INFO L93 Difference]: Finished difference Result 4914 states and 6170 transitions. [2025-02-06 14:37:04,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:37:04,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2025-02-06 14:37:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:04,876 INFO L225 Difference]: With dead ends: 4914 [2025-02-06 14:37:04,876 INFO L226 Difference]: Without dead ends: 2635 [2025-02-06 14:37:04,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:04,881 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 114 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:04,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 353 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:04,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-02-06 14:37:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2480. [2025-02-06 14:37:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 2021 states have (on average 1.2093023255813953) internal successors, (2444), 2054 states have internal predecessors, (2444), 269 states have call successors, (269), 160 states have call predecessors, (269), 182 states have return successors, (361), 269 states have call predecessors, (361), 269 states have call successors, (361) [2025-02-06 14:37:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3074 transitions. [2025-02-06 14:37:04,977 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3074 transitions. Word has length 74 [2025-02-06 14:37:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:04,978 INFO L471 AbstractCegarLoop]: Abstraction has 2480 states and 3074 transitions. [2025-02-06 14:37:04,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 14:37:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3074 transitions. [2025-02-06 14:37:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 14:37:04,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:04,980 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:04,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 14:37:04,980 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:04,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash -276791608, now seen corresponding path program 1 times [2025-02-06 14:37:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:04,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173462990] [2025-02-06 14:37:04,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:04,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 14:37:04,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 14:37:04,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:04,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 14:37:05,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:05,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173462990] [2025-02-06 14:37:05,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173462990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:05,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:05,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:37:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082554080] [2025-02-06 14:37:05,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:05,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:05,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:05,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:05,009 INFO L87 Difference]: Start difference. First operand 2480 states and 3074 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:05,084 INFO L93 Difference]: Finished difference Result 2750 states and 3397 transitions. [2025-02-06 14:37:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:05,085 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), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-02-06 14:37:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:05,093 INFO L225 Difference]: With dead ends: 2750 [2025-02-06 14:37:05,093 INFO L226 Difference]: Without dead ends: 2472 [2025-02-06 14:37:05,094 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 14:37:05,095 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 144 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:05,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 149 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:05,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2025-02-06 14:37:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2349. [2025-02-06 14:37:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 1922 states have (on average 1.211758584807492) internal successors, (2329), 1953 states have internal predecessors, (2329), 247 states have call successors, (247), 150 states have call predecessors, (247), 172 states have return successors, (336), 247 states have call predecessors, (336), 247 states have call successors, (336) [2025-02-06 14:37:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 2912 transitions. [2025-02-06 14:37:05,176 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 2912 transitions. Word has length 74 [2025-02-06 14:37:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:05,176 INFO L471 AbstractCegarLoop]: Abstraction has 2349 states and 2912 transitions. [2025-02-06 14:37:05,176 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), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 2912 transitions. [2025-02-06 14:37:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 14:37:05,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:05,179 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:05,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:37:05,179 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:05,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:05,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1689585919, now seen corresponding path program 1 times [2025-02-06 14:37:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:05,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128322063] [2025-02-06 14:37:05,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:05,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:05,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 14:37:05,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 14:37:05,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:05,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:37:05,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:05,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128322063] [2025-02-06 14:37:05,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128322063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:05,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:05,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:05,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135826642] [2025-02-06 14:37:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:05,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:05,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:05,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:05,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:05,256 INFO L87 Difference]: Start difference. First operand 2349 states and 2912 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 14:37:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:05,622 INFO L93 Difference]: Finished difference Result 4724 states and 5840 transitions. [2025-02-06 14:37:05,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:37:05,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2025-02-06 14:37:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:05,633 INFO L225 Difference]: With dead ends: 4724 [2025-02-06 14:37:05,634 INFO L226 Difference]: Without dead ends: 2330 [2025-02-06 14:37:05,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:37:05,639 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 820 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:05,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 886 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:37:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-02-06 14:37:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2288. [2025-02-06 14:37:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2288 states, 1874 states have (on average 1.196905016008538) internal successors, (2243), 1905 states have internal predecessors, (2243), 239 states have call successors, (239), 145 states have call predecessors, (239), 167 states have return successors, (283), 239 states have call predecessors, (283), 239 states have call successors, (283) [2025-02-06 14:37:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 2765 transitions. [2025-02-06 14:37:05,744 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 2765 transitions. Word has length 75 [2025-02-06 14:37:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:05,744 INFO L471 AbstractCegarLoop]: Abstraction has 2288 states and 2765 transitions. [2025-02-06 14:37:05,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 14:37:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2765 transitions. [2025-02-06 14:37:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 14:37:05,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:05,749 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:05,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 14:37:05,750 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:05,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:05,750 INFO L85 PathProgramCache]: Analyzing trace with hash -313339586, now seen corresponding path program 1 times [2025-02-06 14:37:05,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:05,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111359602] [2025-02-06 14:37:05,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:05,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 14:37:05,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 14:37:05,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:05,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 14:37:05,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:05,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111359602] [2025-02-06 14:37:05,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111359602] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:05,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775760877] [2025-02-06 14:37:05,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:05,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:05,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:05,866 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 14:37:05,868 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 14:37:05,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 14:37:05,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 14:37:05,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:05,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:05,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:37:05,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 14:37:06,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:06,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775760877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:06,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:37:06,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-02-06 14:37:06,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309751006] [2025-02-06 14:37:06,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:06,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:06,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:06,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:06,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:06,055 INFO L87 Difference]: Start difference. First operand 2288 states and 2765 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 14:37:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:06,091 INFO L93 Difference]: Finished difference Result 2922 states and 3549 transitions. [2025-02-06 14:37:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:06,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2025-02-06 14:37:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:06,096 INFO L225 Difference]: With dead ends: 2922 [2025-02-06 14:37:06,096 INFO L226 Difference]: Without dead ends: 814 [2025-02-06 14:37:06,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:06,099 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:06,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 121 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-02-06 14:37:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2025-02-06 14:37:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 661 states have (on average 1.161875945537065) internal successors, (768), 667 states have internal predecessors, (768), 92 states have call successors, (92), 55 states have call predecessors, (92), 59 states have return successors, (100), 92 states have call predecessors, (100), 92 states have call successors, (100) [2025-02-06 14:37:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 960 transitions. [2025-02-06 14:37:06,156 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 960 transitions. Word has length 129 [2025-02-06 14:37:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:06,156 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 960 transitions. [2025-02-06 14:37:06,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 14:37:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 960 transitions. [2025-02-06 14:37:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 14:37:06,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:06,158 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 14:37:06,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 14:37:06,362 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,SelfDestructingSolverStorable12 [2025-02-06 14:37:06,362 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:06,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash -866732266, now seen corresponding path program 1 times [2025-02-06 14:37:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051539479] [2025-02-06 14:37:06,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:06,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 14:37:06,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 14:37:06,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:06,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 14:37:06,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051539479] [2025-02-06 14:37:06,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051539479] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146977548] [2025-02-06 14:37:06,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:06,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:06,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:06,447 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 14:37:06,449 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 14:37:06,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 14:37:06,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 14:37:06,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:06,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:06,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:37:06,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 14:37:06,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:06,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146977548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:06,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:37:06,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-02-06 14:37:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602179205] [2025-02-06 14:37:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:06,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:06,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:06,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:06,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:06,628 INFO L87 Difference]: Start difference. First operand 814 states and 960 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 14:37:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:06,677 INFO L93 Difference]: Finished difference Result 1828 states and 2144 transitions. [2025-02-06 14:37:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:06,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 134 [2025-02-06 14:37:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:06,698 INFO L225 Difference]: With dead ends: 1828 [2025-02-06 14:37:06,698 INFO L226 Difference]: Without dead ends: 1228 [2025-02-06 14:37:06,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:06,699 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 35 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:06,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 228 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2025-02-06 14:37:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2025-02-06 14:37:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 991 states have (on average 1.1422805247225025) internal successors, (1132), 997 states have internal predecessors, (1132), 141 states have call successors, (141), 90 states have call predecessors, (141), 94 states have return successors, (149), 141 states have call predecessors, (149), 141 states have call successors, (149) [2025-02-06 14:37:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1422 transitions. [2025-02-06 14:37:06,750 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1422 transitions. Word has length 134 [2025-02-06 14:37:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:06,751 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1422 transitions. [2025-02-06 14:37:06,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 14:37:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1422 transitions. [2025-02-06 14:37:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 14:37:06,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:06,753 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:37:06,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 14:37:06,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:06,958 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:06,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash 155532282, now seen corresponding path program 1 times [2025-02-06 14:37:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:06,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503701794] [2025-02-06 14:37:06,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:06,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:06,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 14:37:06,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 14:37:06,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:06,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 23 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-06 14:37:07,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:07,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503701794] [2025-02-06 14:37:07,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503701794] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:07,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046788182] [2025-02-06 14:37:07,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:07,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:07,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:07,056 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 14:37:07,061 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 14:37:07,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 14:37:07,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 14:37:07,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:07,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:07,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:37:07,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 14:37:07,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:07,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046788182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:07,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:37:07,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-02-06 14:37:07,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919646208] [2025-02-06 14:37:07,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:07,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:37:07,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:07,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:37:07,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:37:07,380 INFO L87 Difference]: Start difference. First operand 1228 states and 1422 transitions. Second operand has 4 states, 3 states have (on average 34.333333333333336) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 14:37:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:07,457 INFO L93 Difference]: Finished difference Result 1381 states and 1604 transitions. [2025-02-06 14:37:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:37:07,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 34.333333333333336) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 157 [2025-02-06 14:37:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:07,462 INFO L225 Difference]: With dead ends: 1381 [2025-02-06 14:37:07,462 INFO L226 Difference]: Without dead ends: 1022 [2025-02-06 14:37:07,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:37:07,463 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 80 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:07,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 271 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:07,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-02-06 14:37:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2025-02-06 14:37:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 825 states have (on average 1.1357575757575757) internal successors, (937), 829 states have internal predecessors, (937), 118 states have call successors, (118), 75 states have call predecessors, (118), 78 states have return successors, (124), 118 states have call predecessors, (124), 118 states have call successors, (124) [2025-02-06 14:37:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1179 transitions. [2025-02-06 14:37:07,525 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1179 transitions. Word has length 157 [2025-02-06 14:37:07,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:07,525 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1179 transitions. [2025-02-06 14:37:07,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 34.333333333333336) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 14:37:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1179 transitions. [2025-02-06 14:37:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 14:37:07,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:07,528 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:07,534 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 14:37:07,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:07,729 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:07,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash 526533555, now seen corresponding path program 1 times [2025-02-06 14:37:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:07,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400674979] [2025-02-06 14:37:07,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:07,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 14:37:07,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 14:37:07,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:07,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-06 14:37:07,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:07,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400674979] [2025-02-06 14:37:07,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400674979] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:07,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017481197] [2025-02-06 14:37:07,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:07,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:07,819 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:37:07,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:37:07,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 14:37:07,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 14:37:07,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:07,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:07,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:37:07,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 14:37:08,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:37:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-02-06 14:37:08,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017481197] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:37:08,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:37:08,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 3] total 12 [2025-02-06 14:37:08,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417679333] [2025-02-06 14:37:08,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:37:08,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 14:37:08,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:08,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 14:37:08,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:37:08,183 INFO L87 Difference]: Start difference. First operand 1022 states and 1179 transitions. Second operand has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 11 states have internal predecessors, (260), 7 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 8 states have call predecessors, (40), 7 states have call successors, (40) [2025-02-06 14:37:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:08,456 INFO L93 Difference]: Finished difference Result 2329 states and 2709 transitions. [2025-02-06 14:37:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 14:37:08,457 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 11 states have internal predecessors, (260), 7 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 8 states have call predecessors, (40), 7 states have call successors, (40) Word has length 158 [2025-02-06 14:37:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:08,461 INFO L225 Difference]: With dead ends: 2329 [2025-02-06 14:37:08,462 INFO L226 Difference]: Without dead ends: 1318 [2025-02-06 14:37:08,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2025-02-06 14:37:08,464 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 295 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:08,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1040 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-02-06 14:37:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2025-02-06 14:37:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1101 states have (on average 1.1435059037238873) internal successors, (1259), 1101 states have internal predecessors, (1259), 126 states have call successors, (126), 82 states have call predecessors, (126), 90 states have return successors, (142), 134 states have call predecessors, (142), 126 states have call successors, (142) [2025-02-06 14:37:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1527 transitions. [2025-02-06 14:37:08,538 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1527 transitions. Word has length 158 [2025-02-06 14:37:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:08,540 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1527 transitions. [2025-02-06 14:37:08,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 11 states have internal predecessors, (260), 7 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 8 states have call predecessors, (40), 7 states have call successors, (40) [2025-02-06 14:37:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1527 transitions. [2025-02-06 14:37:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-06 14:37:08,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:08,551 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 12, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:08,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 14:37:08,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 14:37:08,756 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:08,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash 578925725, now seen corresponding path program 1 times [2025-02-06 14:37:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285032448] [2025-02-06 14:37:08,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:08,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-06 14:37:08,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-06 14:37:08,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:08,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 1263 trivial. 0 not checked. [2025-02-06 14:37:09,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:09,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285032448] [2025-02-06 14:37:09,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285032448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:09,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:09,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:37:09,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902518031] [2025-02-06 14:37:09,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:09,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:09,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:09,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:09,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:09,026 INFO L87 Difference]: Start difference. First operand 1318 states and 1527 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 14:37:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:09,054 INFO L93 Difference]: Finished difference Result 1319 states and 1527 transitions. [2025-02-06 14:37:09,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:09,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 406 [2025-02-06 14:37:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:09,058 INFO L225 Difference]: With dead ends: 1319 [2025-02-06 14:37:09,058 INFO L226 Difference]: Without dead ends: 678 [2025-02-06 14:37:09,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 14:37:09,060 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 36 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:09,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 204 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-02-06 14:37:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2025-02-06 14:37:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 565 states have (on average 1.1486725663716815) internal successors, (649), 565 states have internal predecessors, (649), 65 states have call successors, (65), 43 states have call predecessors, (65), 47 states have return successors, (73), 69 states have call predecessors, (73), 65 states have call successors, (73) [2025-02-06 14:37:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 787 transitions. [2025-02-06 14:37:09,087 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 787 transitions. Word has length 406 [2025-02-06 14:37:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:09,087 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 787 transitions. [2025-02-06 14:37:09,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 14:37:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 787 transitions. [2025-02-06 14:37:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-02-06 14:37:09,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:09,092 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 13, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:09,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 14:37:09,092 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:09,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:09,093 INFO L85 PathProgramCache]: Analyzing trace with hash -272977867, now seen corresponding path program 1 times [2025-02-06 14:37:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:09,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612687509] [2025-02-06 14:37:09,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:09,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-02-06 14:37:09,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-02-06 14:37:09,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:09,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 178 proven. 28 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2025-02-06 14:37:09,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:09,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612687509] [2025-02-06 14:37:09,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612687509] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:09,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278890616] [2025-02-06 14:37:09,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:09,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:09,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:09,181 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:37:09,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:37:09,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-02-06 14:37:09,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-02-06 14:37:09,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:09,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:09,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:37:09,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 921 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-02-06 14:37:09,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:09,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278890616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:09,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:37:09,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 14:37:09,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30421361] [2025-02-06 14:37:09,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:09,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:09,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:09,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:09,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:09,392 INFO L87 Difference]: Start difference. First operand 678 states and 787 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 14:37:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:09,438 INFO L93 Difference]: Finished difference Result 1588 states and 1861 transitions. [2025-02-06 14:37:09,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:09,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 420 [2025-02-06 14:37:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:09,443 INFO L225 Difference]: With dead ends: 1588 [2025-02-06 14:37:09,443 INFO L226 Difference]: Without dead ends: 1039 [2025-02-06 14:37:09,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:09,444 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 32 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:09,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 292 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-02-06 14:37:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 984. [2025-02-06 14:37:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 823 states have (on average 1.1470230862697448) internal successors, (944), 823 states have internal predecessors, (944), 94 states have call successors, (94), 62 states have call predecessors, (94), 66 states have return successors, (102), 98 states have call predecessors, (102), 94 states have call successors, (102) [2025-02-06 14:37:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1140 transitions. [2025-02-06 14:37:09,475 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1140 transitions. Word has length 420 [2025-02-06 14:37:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:09,475 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1140 transitions. [2025-02-06 14:37:09,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 14:37:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1140 transitions. [2025-02-06 14:37:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-02-06 14:37:09,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:09,479 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 13, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:09,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 14:37:09,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 14:37:09,680 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:09,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:09,681 INFO L85 PathProgramCache]: Analyzing trace with hash 597843732, now seen corresponding path program 1 times [2025-02-06 14:37:09,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:09,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546177100] [2025-02-06 14:37:09,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:09,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:09,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-02-06 14:37:09,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-02-06 14:37:09,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:09,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 178 proven. 28 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2025-02-06 14:37:09,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:09,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546177100] [2025-02-06 14:37:09,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546177100] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:09,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399292126] [2025-02-06 14:37:09,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:09,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:09,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:09,779 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:37:09,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 14:37:09,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-02-06 14:37:09,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-02-06 14:37:09,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:09,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:09,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:37:09,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 549 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-02-06 14:37:09,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:09,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399292126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:09,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:37:09,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-02-06 14:37:09,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57923273] [2025-02-06 14:37:09,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:09,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:09,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:09,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:09,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:09,965 INFO L87 Difference]: Start difference. First operand 984 states and 1140 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 14:37:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:09,994 INFO L93 Difference]: Finished difference Result 1893 states and 2226 transitions. [2025-02-06 14:37:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:09,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 420 [2025-02-06 14:37:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:09,998 INFO L225 Difference]: With dead ends: 1893 [2025-02-06 14:37:09,998 INFO L226 Difference]: Without dead ends: 984 [2025-02-06 14:37:09,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:10,000 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 49 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:10,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-02-06 14:37:10,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2025-02-06 14:37:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 823 states have (on average 1.1275820170109356) internal successors, (928), 823 states have internal predecessors, (928), 94 states have call successors, (94), 62 states have call predecessors, (94), 66 states have return successors, (102), 98 states have call predecessors, (102), 94 states have call successors, (102) [2025-02-06 14:37:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1124 transitions. [2025-02-06 14:37:10,031 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1124 transitions. Word has length 420 [2025-02-06 14:37:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:10,031 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1124 transitions. [2025-02-06 14:37:10,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 14:37:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1124 transitions. [2025-02-06 14:37:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-02-06 14:37:10,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:10,036 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 13, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:10,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 14:37:10,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:10,237 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:10,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:10,238 INFO L85 PathProgramCache]: Analyzing trace with hash -735637986, now seen corresponding path program 1 times [2025-02-06 14:37:10,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:10,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057774685] [2025-02-06 14:37:10,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:10,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:10,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-02-06 14:37:10,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-02-06 14:37:10,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:10,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2025-02-06 14:37:10,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:10,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057774685] [2025-02-06 14:37:10,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057774685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:10,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:10,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:37:10,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087251415] [2025-02-06 14:37:10,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:10,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:10,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:10,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:10,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:10,304 INFO L87 Difference]: Start difference. First operand 984 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 14:37:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:10,324 INFO L93 Difference]: Finished difference Result 1473 states and 1681 transitions. [2025-02-06 14:37:10,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:10,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 425 [2025-02-06 14:37:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:10,327 INFO L225 Difference]: With dead ends: 1473 [2025-02-06 14:37:10,327 INFO L226 Difference]: Without dead ends: 564 [2025-02-06 14:37:10,329 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 14:37:10,329 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 17 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:10,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 234 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-06 14:37:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-02-06 14:37:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 479 states have (on average 1.091858037578288) internal successors, (523), 479 states have internal predecessors, (523), 46 states have call successors, (46), 34 states have call predecessors, (46), 38 states have return successors, (50), 50 states have call predecessors, (50), 46 states have call successors, (50) [2025-02-06 14:37:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 619 transitions. [2025-02-06 14:37:10,363 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 619 transitions. Word has length 425 [2025-02-06 14:37:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:10,363 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 619 transitions. [2025-02-06 14:37:10,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 14:37:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 619 transitions. [2025-02-06 14:37:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-02-06 14:37:10,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:10,367 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 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 14:37:10,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 14:37:10,367 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:10,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:10,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2100344358, now seen corresponding path program 1 times [2025-02-06 14:37:10,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:10,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936474845] [2025-02-06 14:37:10,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:10,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:10,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-02-06 14:37:10,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-02-06 14:37:10,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:10,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 243 proven. 27 refuted. 0 times theorem prover too weak. 1613 trivial. 0 not checked. [2025-02-06 14:37:10,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936474845] [2025-02-06 14:37:10,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936474845] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814280488] [2025-02-06 14:37:10,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:10,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:10,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:10,587 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:37:10,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 14:37:10,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-02-06 14:37:10,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-02-06 14:37:10,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:10,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:10,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 14:37:10,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 1034 proven. 1 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2025-02-06 14:37:10,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:37:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 269 proven. 1 refuted. 0 times theorem prover too weak. 1613 trivial. 0 not checked. [2025-02-06 14:37:11,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814280488] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:37:11,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:37:11,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 14:37:11,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3087494] [2025-02-06 14:37:11,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:37:11,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:37:11,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:11,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:37:11,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:37:11,110 INFO L87 Difference]: Start difference. First operand 564 states and 619 transitions. Second operand has 8 states, 8 states have (on average 33.0) internal successors, (264), 8 states have internal predecessors, (264), 5 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2025-02-06 14:37:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:11,193 INFO L93 Difference]: Finished difference Result 934 states and 1028 transitions. [2025-02-06 14:37:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:37:11,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.0) internal successors, (264), 8 states have internal predecessors, (264), 5 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 497 [2025-02-06 14:37:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:11,196 INFO L225 Difference]: With dead ends: 934 [2025-02-06 14:37:11,196 INFO L226 Difference]: Without dead ends: 564 [2025-02-06 14:37:11,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 999 GetRequests, 989 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:11,197 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 58 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:11,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 557 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-06 14:37:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-02-06 14:37:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 479 states have (on average 1.0835073068893528) internal successors, (519), 479 states have internal predecessors, (519), 46 states have call successors, (46), 34 states have call predecessors, (46), 38 states have return successors, (50), 50 states have call predecessors, (50), 46 states have call successors, (50) [2025-02-06 14:37:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 615 transitions. [2025-02-06 14:37:11,221 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 615 transitions. Word has length 497 [2025-02-06 14:37:11,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:11,222 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 615 transitions. [2025-02-06 14:37:11,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.0) internal successors, (264), 8 states have internal predecessors, (264), 5 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2025-02-06 14:37:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 615 transitions. [2025-02-06 14:37:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-02-06 14:37:11,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:11,226 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 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 14:37:11,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 14:37:11,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:11,427 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:37:11,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash -802317886, now seen corresponding path program 1 times [2025-02-06 14:37:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:11,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563515905] [2025-02-06 14:37:11,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:11,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:11,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-02-06 14:37:11,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-02-06 14:37:11,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:11,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1889 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2025-02-06 14:37:11,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563515905] [2025-02-06 14:37:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563515905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:11,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:11,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:37:11,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047280423] [2025-02-06 14:37:11,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:11,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:37:11,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:11,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:37:11,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:11,551 INFO L87 Difference]: Start difference. First operand 564 states and 615 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 14:37:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:11,589 INFO L93 Difference]: Finished difference Result 564 states and 615 transitions. [2025-02-06 14:37:11,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:37:11,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 501 [2025-02-06 14:37:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:11,591 INFO L225 Difference]: With dead ends: 564 [2025-02-06 14:37:11,592 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:37:11,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:11,593 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 61 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:11,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 282 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:37:11,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:37:11,593 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 14:37:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:37:11,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 501 [2025-02-06 14:37:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:11,594 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:37:11,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 14:37:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:37:11,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:37:11,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-06 14:37:11,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-06 14:37:11,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-06 14:37:11,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-06 14:37:11,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-06 14:37:11,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-06 14:37:11,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-06 14:37:11,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-06 14:37:11,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 14:37:11,598 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] [2025-02-06 14:37:11,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:37:15,629 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:37:15,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:37:15 BoogieIcfgContainer [2025-02-06 14:37:15,651 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:37:15,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:37:15,651 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:37:15,651 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:37:15,652 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:01" (3/4) ... [2025-02-06 14:37:15,653 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:37:15,659 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure activate_threads [2025-02-06 14:37:15,659 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2025-02-06 14:37:15,659 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2025-02-06 14:37:15,659 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure update_channels [2025-02-06 14:37:15,659 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2025-02-06 14:37:15,660 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure error [2025-02-06 14:37:15,664 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-06 14:37:15,665 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 14:37:15,666 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:37:15,666 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:37:15,736 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:37:15,737 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:37:15,737 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:37:15,738 INFO L158 Benchmark]: Toolchain (without parser) took 14435.74ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 132.4MB in the beginning and 293.2MB in the end (delta: -160.9MB). Peak memory consumption was 161.3MB. Max. memory is 16.1GB. [2025-02-06 14:37:15,738 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 226.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:37:15,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.46ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 119.0MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:37:15,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.85ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 117.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:37:15,739 INFO L158 Benchmark]: Boogie Preprocessor took 28.64ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 115.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:37:15,739 INFO L158 Benchmark]: IcfgBuilder took 376.35ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 94.6MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 14:37:15,740 INFO L158 Benchmark]: TraceAbstraction took 13682.65ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 93.9MB in the beginning and 301.6MB in the end (delta: -207.8MB). Peak memory consumption was 255.4MB. Max. memory is 16.1GB. [2025-02-06 14:37:15,740 INFO L158 Benchmark]: Witness Printer took 86.20ms. Allocated memory is still 494.9MB. Free memory was 301.6MB in the beginning and 293.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:37:15,741 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.17ms. Allocated memory is still 226.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.46ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 119.0MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.85ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 117.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.64ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 115.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 376.35ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 94.6MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13682.65ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 93.9MB in the beginning and 301.6MB in the end (delta: -207.8MB). Peak memory consumption was 255.4MB. Max. memory is 16.1GB. * Witness Printer took 86.20ms. Allocated memory is still 494.9MB. Free memory was 301.6MB in the beginning and 293.2MB in the end (delta: 8.4MB). 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: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: 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 7 procedures, 127 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 22, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3807 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3790 mSDsluCounter, 9326 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5530 mSDsCounter, 451 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1142 IncrementalHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 451 mSolverCounterUnsat, 3796 mSDtfsCounter, 1142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2714 GetRequests, 2608 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2607occurred in iteration=9, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 662 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 5858 NumberOfCodeBlocks, 5858 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6482 ConstructedInterpolants, 0 QuantifiedInterpolants, 9599 SizeOfPredicates, 1 NumberOfNonLiveVariables, 4818 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 31 InterpolantComputations, 20 PerfectInterpolantSequences, 17061/17348 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 156]: Location Invariant Derived location invariant: ((((((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_pc == 0)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0)) || ((((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1))) - InvariantResult [Line: 93]: Location Invariant Derived location invariant: ((((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1)) && (P_1_st != 0)) || ((((((((C_1_pc == 1) && (e <= 0)) && (P_1_ev <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((2 <= P_1_ev) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) - InvariantResult [Line: 279]: Location Invariant Derived location invariant: ((((((((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1)) || ((((((((((C_1_st == 0) && (P_1_pc == 1)) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_pc == 0)) && (num == 1)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((C_1_pc == 1) && (e <= 0)) && (P_1_ev <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1))) || ((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((2 <= P_1_ev) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1))) || (((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1)) && (P_1_st != 0))) - InvariantResult [Line: 445]: Location Invariant Derived location invariant: ((((((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1)) || ((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((2 <= P_1_ev) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1))) || (((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1)) && (P_1_st != 0))) RESULT: Ultimate proved your program to be correct! [2025-02-06 14:37:15,760 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