./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/xcsp/AllInterval-006.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/AllInterval-006.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5db620ad631bbb2b4f2f184a6694f3d470d0214c96a5cb4b6c65ad330c77841f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:35:31,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:35:31,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:35:31,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:35:31,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:35:31,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:35:31,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:35:31,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:35:31,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:35:31,507 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:35:31,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:35:31,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:35:31,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:35:31,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:35:31,508 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:35:31,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:35:31,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:35:31,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:35:31,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:35:31,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:35:31,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:35:31,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:35:31,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:35:31,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:35:31,509 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:35:31,509 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:35:31,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:35:31,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:35:31,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:35:31,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:35:31,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:35:31,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:35:31,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:35:31,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:35:31,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:31,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:35:31,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:35:31,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:35:31,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:35:31,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:35:31,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:35:31,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:35:31,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:35:31,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:35:31,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:35:31,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5db620ad631bbb2b4f2f184a6694f3d470d0214c96a5cb4b6c65ad330c77841f [2025-03-04 11:35:31,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:35:31,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:35:31,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:35:31,722 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:35:31,723 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:35:31,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-006.c [2025-03-04 11:35:32,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec641434b/0c398044b48747eb98b180e37c1925cf/FLAG3d539679d [2025-03-04 11:35:33,126 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:35:33,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-006.c [2025-03-04 11:35:33,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec641434b/0c398044b48747eb98b180e37c1925cf/FLAG3d539679d [2025-03-04 11:35:33,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec641434b/0c398044b48747eb98b180e37c1925cf [2025-03-04 11:35:33,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:35:33,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:35:33,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:33,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:35:33,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:35:33,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9577a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33, skipping insertion in model container [2025-03-04 11:35:33,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:35:33,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:33,567 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:35:33,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:33,601 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:35:33,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33 WrapperNode [2025-03-04 11:35:33,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:33,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:33,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:35:33,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:35:33,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,638 INFO L138 Inliner]: procedures = 13, calls = 60, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 175 [2025-03-04 11:35:33,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:33,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:35:33,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:35:33,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:35:33,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,667 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:35:33,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,671 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:35:33,682 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:35:33,682 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:35:33,682 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:35:33,683 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (1/1) ... [2025-03-04 11:35:33,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:33,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:33,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:35:33,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:35:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:35:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:35:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:35:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:35:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2025-03-04 11:35:33,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2025-03-04 11:35:33,779 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:35:33,780 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:35:33,993 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-04 11:35:33,993 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:35:34,004 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:35:34,004 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:35:34,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:34 BoogieIcfgContainer [2025-03-04 11:35:34,004 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:35:34,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:35:34,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:35:34,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:35:34,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:35:33" (1/3) ... [2025-03-04 11:35:34,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5760f203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:34, skipping insertion in model container [2025-03-04 11:35:34,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:33" (2/3) ... [2025-03-04 11:35:34,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5760f203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:34, skipping insertion in model container [2025-03-04 11:35:34,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:34" (3/3) ... [2025-03-04 11:35:34,013 INFO L128 eAbstractionObserver]: Analyzing ICFG AllInterval-006.c [2025-03-04 11:35:34,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:35:34,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG AllInterval-006.c that has 2 procedures, 125 locations, 1 initial locations, 0 loop locations, and 20 error locations. [2025-03-04 11:35:34,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:35:34,070 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;@51eb0ff4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:35:34,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 11:35:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 71 states have internal predecessors, (77), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 11:35:34,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 11:35:34,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:34,085 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:34,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:34,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:34,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1480420744, now seen corresponding path program 1 times [2025-03-04 11:35:34,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:34,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19921820] [2025-03-04 11:35:34,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:34,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:34,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 11:35:34,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 11:35:34,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:34,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-03-04 11:35:34,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:34,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19921820] [2025-03-04 11:35:34,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19921820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:34,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645024701] [2025-03-04 11:35:34,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:34,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:34,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:34,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:34,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:35:34,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 11:35:34,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 11:35:34,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:34,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:34,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:35:34,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-03-04 11:35:34,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:34,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645024701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:34,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:34,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:35:34,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127760334] [2025-03-04 11:35:34,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:34,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:35:34,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:34,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:35:34,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:35:34,589 INFO L87 Difference]: Start difference. First operand has 125 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 71 states have internal predecessors, (77), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-04 11:35:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:34,619 INFO L93 Difference]: Finished difference Result 243 states and 407 transitions. [2025-03-04 11:35:34,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:35:34,621 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) Word has length 250 [2025-03-04 11:35:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:34,627 INFO L225 Difference]: With dead ends: 243 [2025-03-04 11:35:34,627 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 11:35:34,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:35:34,632 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:34,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 11:35:34,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-04 11:35:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 46 states have (on average 1.5) internal successors, (69), 65 states have internal predecessors, (69), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 171 transitions. [2025-03-04 11:35:34,669 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 171 transitions. Word has length 250 [2025-03-04 11:35:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:34,669 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 171 transitions. [2025-03-04 11:35:34,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-04 11:35:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 171 transitions. [2025-03-04 11:35:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 11:35:34,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:34,672 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:34,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:35:34,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 11:35:34,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:34,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:34,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1068341479, now seen corresponding path program 1 times [2025-03-04 11:35:34,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:34,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339294383] [2025-03-04 11:35:34,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:34,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:34,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 11:35:34,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 11:35:34,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:34,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-04 11:35:35,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:35,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339294383] [2025-03-04 11:35:35,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339294383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:35,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83961904] [2025-03-04 11:35:35,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:35,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:35,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:35,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:35,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:35:35,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 11:35:35,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 11:35:35,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:35,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:35,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:35,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-04 11:35:35,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-04 11:35:36,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83961904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:36,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:36,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:36,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160017553] [2025-03-04 11:35:36,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:36,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:36,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:36,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:36,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:36,146 INFO L87 Difference]: Start difference. First operand 118 states and 171 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 6 states have call successors, (138), 1 states have call predecessors, (138), 2 states have return successors, (139), 5 states have call predecessors, (139), 6 states have call successors, (139) [2025-03-04 11:35:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:36,446 INFO L93 Difference]: Finished difference Result 118 states and 171 transitions. [2025-03-04 11:35:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:36,448 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 6 states have call successors, (138), 1 states have call predecessors, (138), 2 states have return successors, (139), 5 states have call predecessors, (139), 6 states have call successors, (139) Word has length 250 [2025-03-04 11:35:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:36,452 INFO L225 Difference]: With dead ends: 118 [2025-03-04 11:35:36,452 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 11:35:36,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:36,453 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 3 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:36,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 542 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 11:35:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-04 11:35:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 64 states have internal predecessors, (68), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2025-03-04 11:35:36,470 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 250 [2025-03-04 11:35:36,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:36,473 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2025-03-04 11:35:36,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 6 states have call successors, (138), 1 states have call predecessors, (138), 2 states have return successors, (139), 5 states have call predecessors, (139), 6 states have call successors, (139) [2025-03-04 11:35:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2025-03-04 11:35:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-04 11:35:36,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:36,490 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:36,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:36,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 11:35:36,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:36,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1241152549, now seen corresponding path program 1 times [2025-03-04 11:35:36,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:36,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829320229] [2025-03-04 11:35:36,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:36,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:36,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-04 11:35:36,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-04 11:35:36,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:36,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 6 proven. 132 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-04 11:35:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:36,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829320229] [2025-03-04 11:35:36,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829320229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227292639] [2025-03-04 11:35:36,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:36,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:36,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:36,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:36,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:35:36,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-04 11:35:37,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-04 11:35:37,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:37,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:37,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:37,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 6 proven. 132 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-04 11:35:37,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 6 proven. 132 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-04 11:35:37,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227292639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:37,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:37,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-04 11:35:37,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204029783] [2025-03-04 11:35:37,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:37,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:37,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:37,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:37,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:37,473 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 10 states, 8 states have (on average 6.375) internal successors, (51), 10 states have internal predecessors, (51), 5 states have call successors, (136), 1 states have call predecessors, (136), 2 states have return successors, (137), 4 states have call predecessors, (137), 5 states have call successors, (137) [2025-03-04 11:35:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:37,721 INFO L93 Difference]: Finished difference Result 117 states and 170 transitions. [2025-03-04 11:35:37,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:37,723 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.375) internal successors, (51), 10 states have internal predecessors, (51), 5 states have call successors, (136), 1 states have call predecessors, (136), 2 states have return successors, (137), 4 states have call predecessors, (137), 5 states have call successors, (137) Word has length 251 [2025-03-04 11:35:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:37,725 INFO L225 Difference]: With dead ends: 117 [2025-03-04 11:35:37,725 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 11:35:37,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 497 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:37,726 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:37,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 11:35:37,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 11:35:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 63 states have internal predecessors, (67), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2025-03-04 11:35:37,747 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 251 [2025-03-04 11:35:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:37,748 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2025-03-04 11:35:37,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.375) internal successors, (51), 10 states have internal predecessors, (51), 5 states have call successors, (136), 1 states have call predecessors, (136), 2 states have return successors, (137), 4 states have call predecessors, (137), 5 states have call successors, (137) [2025-03-04 11:35:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2025-03-04 11:35:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-04 11:35:37,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:37,750 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:37,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:37,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:37,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:37,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:37,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1253307773, now seen corresponding path program 1 times [2025-03-04 11:35:37,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:37,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718213597] [2025-03-04 11:35:37,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:37,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:37,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-04 11:35:37,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-04 11:35:37,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:37,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-04 11:35:38,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:38,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718213597] [2025-03-04 11:35:38,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718213597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:38,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:38,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:35:38,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874605012] [2025-03-04 11:35:38,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:38,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:38,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:38,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:38,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:38,049 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-03-04 11:35:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:38,096 INFO L93 Difference]: Finished difference Result 116 states and 169 transitions. [2025-03-04 11:35:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:38,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 253 [2025-03-04 11:35:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:38,099 INFO L225 Difference]: With dead ends: 116 [2025-03-04 11:35:38,099 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 11:35:38,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:38,100 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 5 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:38,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 280 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 11:35:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-04 11:35:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 58 states have internal predecessors, (62), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 164 transitions. [2025-03-04 11:35:38,115 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 164 transitions. Word has length 253 [2025-03-04 11:35:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:38,116 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 164 transitions. [2025-03-04 11:35:38,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-03-04 11:35:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 164 transitions. [2025-03-04 11:35:38,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-04 11:35:38,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:38,119 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:38,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:35:38,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:38,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:38,119 INFO L85 PathProgramCache]: Analyzing trace with hash -197835274, now seen corresponding path program 1 times [2025-03-04 11:35:38,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:38,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797143795] [2025-03-04 11:35:38,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:38,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:38,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-04 11:35:38,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-04 11:35:38,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:38,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-04 11:35:38,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:38,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797143795] [2025-03-04 11:35:38,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797143795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:38,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990202584] [2025-03-04 11:35:38,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:38,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:38,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:38,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:38,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:35:38,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-04 11:35:38,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-04 11:35:38,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:38,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:38,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:35:38,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-04 11:35:38,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-03-04 11:35:38,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990202584] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:38,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:38,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-04 11:35:38,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141546335] [2025-03-04 11:35:38,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:38,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:35:38,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:38,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:35:38,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:38,842 INFO L87 Difference]: Start difference. First operand 111 states and 164 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (92), 1 states have call predecessors, (92), 2 states have return successors, (92), 3 states have call predecessors, (92), 4 states have call successors, (92) [2025-03-04 11:35:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:39,033 INFO L93 Difference]: Finished difference Result 111 states and 164 transitions. [2025-03-04 11:35:39,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:35:39,034 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (92), 1 states have call predecessors, (92), 2 states have return successors, (92), 3 states have call predecessors, (92), 4 states have call successors, (92) Word has length 254 [2025-03-04 11:35:39,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:39,035 INFO L225 Difference]: With dead ends: 111 [2025-03-04 11:35:39,035 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 11:35:39,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 503 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:39,036 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:39,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 11:35:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 11:35:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 46 states have (on average 1.326086956521739) internal successors, (61), 57 states have internal predecessors, (61), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 163 transitions. [2025-03-04 11:35:39,051 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 163 transitions. Word has length 254 [2025-03-04 11:35:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:39,051 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 163 transitions. [2025-03-04 11:35:39,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (92), 1 states have call predecessors, (92), 2 states have return successors, (92), 3 states have call predecessors, (92), 4 states have call successors, (92) [2025-03-04 11:35:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 163 transitions. [2025-03-04 11:35:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-04 11:35:39,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:39,056 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:39,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:39,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:39,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:39,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:39,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2135689795, now seen corresponding path program 1 times [2025-03-04 11:35:39,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:39,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89951201] [2025-03-04 11:35:39,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:39,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-04 11:35:39,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-04 11:35:39,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:39,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 6 proven. 135 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-03-04 11:35:39,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:39,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89951201] [2025-03-04 11:35:39,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89951201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:39,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498772934] [2025-03-04 11:35:39,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:39,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:39,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:39,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:39,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:35:39,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-04 11:35:39,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-04 11:35:39,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:39,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:39,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:39,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 6 proven. 135 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-03-04 11:35:39,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 6 proven. 135 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-03-04 11:35:39,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498772934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:39,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:39,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:39,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822709788] [2025-03-04 11:35:39,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:39,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:39,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:39,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:39,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:39,879 INFO L87 Difference]: Start difference. First operand 110 states and 163 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 6 states have call successors, (137), 1 states have call predecessors, (137), 2 states have return successors, (138), 6 states have call predecessors, (138), 6 states have call successors, (138) [2025-03-04 11:35:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:40,073 INFO L93 Difference]: Finished difference Result 110 states and 163 transitions. [2025-03-04 11:35:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:40,074 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 6 states have call successors, (137), 1 states have call predecessors, (137), 2 states have return successors, (138), 6 states have call predecessors, (138), 6 states have call successors, (138) Word has length 259 [2025-03-04 11:35:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:40,075 INFO L225 Difference]: With dead ends: 110 [2025-03-04 11:35:40,076 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 11:35:40,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:40,076 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 8 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:40,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 550 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 11:35:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 11:35:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 56 states have internal predecessors, (60), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 162 transitions. [2025-03-04 11:35:40,090 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 162 transitions. Word has length 259 [2025-03-04 11:35:40,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:40,092 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 162 transitions. [2025-03-04 11:35:40,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 6 states have call successors, (137), 1 states have call predecessors, (137), 2 states have return successors, (138), 6 states have call predecessors, (138), 6 states have call successors, (138) [2025-03-04 11:35:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 162 transitions. [2025-03-04 11:35:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-04 11:35:40,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:40,094 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:40,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 11:35:40,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:40,295 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:40,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1781874223, now seen corresponding path program 1 times [2025-03-04 11:35:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:40,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421166594] [2025-03-04 11:35:40,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:40,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:40,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-04 11:35:40,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-04 11:35:40,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:40,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 12 proven. 129 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-03-04 11:35:40,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421166594] [2025-03-04 11:35:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421166594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465304814] [2025-03-04 11:35:40,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:40,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:40,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:40,530 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:40,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:35:40,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-04 11:35:40,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-04 11:35:40,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:40,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:40,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:40,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 12 proven. 129 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-03-04 11:35:40,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 12 proven. 129 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-03-04 11:35:41,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465304814] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:41,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:41,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-03-04 11:35:41,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781865903] [2025-03-04 11:35:41,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:41,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:35:41,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:41,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:35:41,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:35:41,013 INFO L87 Difference]: Start difference. First operand 109 states and 162 transitions. Second operand has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 13 states have internal predecessors, (63), 8 states have call successors, (139), 1 states have call predecessors, (139), 2 states have return successors, (140), 7 states have call predecessors, (140), 8 states have call successors, (140) [2025-03-04 11:35:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:41,337 INFO L93 Difference]: Finished difference Result 109 states and 162 transitions. [2025-03-04 11:35:41,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:35:41,338 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 13 states have internal predecessors, (63), 8 states have call successors, (139), 1 states have call predecessors, (139), 2 states have return successors, (140), 7 states have call predecessors, (140), 8 states have call successors, (140) Word has length 260 [2025-03-04 11:35:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:41,339 INFO L225 Difference]: With dead ends: 109 [2025-03-04 11:35:41,339 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 11:35:41,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 514 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:35:41,340 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 20 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:41,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 742 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 11:35:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-04 11:35:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 55 states have internal predecessors, (59), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 161 transitions. [2025-03-04 11:35:41,351 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 161 transitions. Word has length 260 [2025-03-04 11:35:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:41,351 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 161 transitions. [2025-03-04 11:35:41,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 13 states have internal predecessors, (63), 8 states have call successors, (139), 1 states have call predecessors, (139), 2 states have return successors, (140), 7 states have call predecessors, (140), 8 states have call successors, (140) [2025-03-04 11:35:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 161 transitions. [2025-03-04 11:35:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-04 11:35:41,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:41,353 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:41,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:41,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:41,557 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:41,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:41,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1980784352, now seen corresponding path program 1 times [2025-03-04 11:35:41,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:41,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731185160] [2025-03-04 11:35:41,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:41,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-04 11:35:41,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-04 11:35:41,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:41,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 18 proven. 258 refuted. 0 times theorem prover too weak. 4236 trivial. 0 not checked. [2025-03-04 11:35:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:41,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731185160] [2025-03-04 11:35:41,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731185160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:41,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755623211] [2025-03-04 11:35:41,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:41,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:41,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:41,759 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:41,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:35:41,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-04 11:35:41,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-04 11:35:41,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:41,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:41,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:35:41,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 6 proven. 135 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-03-04 11:35:42,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 6 proven. 135 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-03-04 11:35:42,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755623211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:42,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:42,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 11:35:42,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571367773] [2025-03-04 11:35:42,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:42,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:35:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:42,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:35:42,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:35:42,218 INFO L87 Difference]: Start difference. First operand 108 states and 161 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 5 states have call successors, (136), 1 states have call predecessors, (136), 2 states have return successors, (136), 5 states have call predecessors, (136), 5 states have call successors, (136) [2025-03-04 11:35:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:42,426 INFO L93 Difference]: Finished difference Result 108 states and 161 transitions. [2025-03-04 11:35:42,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:35:42,427 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 5 states have call successors, (136), 1 states have call predecessors, (136), 2 states have return successors, (136), 5 states have call predecessors, (136), 5 states have call successors, (136) Word has length 263 [2025-03-04 11:35:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:42,428 INFO L225 Difference]: With dead ends: 108 [2025-03-04 11:35:42,428 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 11:35:42,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 522 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:35:42,429 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 9 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:42,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 382 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 11:35:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-04 11:35:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 54 states have internal predecessors, (58), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 160 transitions. [2025-03-04 11:35:42,439 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 160 transitions. Word has length 263 [2025-03-04 11:35:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:42,439 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 160 transitions. [2025-03-04 11:35:42,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 5 states have call successors, (136), 1 states have call predecessors, (136), 2 states have return successors, (136), 5 states have call predecessors, (136), 5 states have call successors, (136) [2025-03-04 11:35:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 160 transitions. [2025-03-04 11:35:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-04 11:35:42,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:42,442 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:42,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:42,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:42,643 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:42,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash 261001029, now seen corresponding path program 1 times [2025-03-04 11:35:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:42,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804891983] [2025-03-04 11:35:42,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:42,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-04 11:35:42,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-04 11:35:42,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:42,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-03-04 11:35:42,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:42,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804891983] [2025-03-04 11:35:42,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804891983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:42,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860604006] [2025-03-04 11:35:42,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:42,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:42,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:42,818 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:42,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:35:42,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-04 11:35:42,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-04 11:35:42,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:42,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:42,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:35:42,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 198 proven. 342 refuted. 0 times theorem prover too weak. 4164 trivial. 0 not checked. [2025-03-04 11:35:43,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 198 proven. 342 refuted. 0 times theorem prover too weak. 4164 trivial. 0 not checked. [2025-03-04 11:35:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860604006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:43,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:43,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-04 11:35:43,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257227848] [2025-03-04 11:35:43,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:43,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:35:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:43,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:35:43,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:35:43,503 INFO L87 Difference]: Start difference. First operand 107 states and 160 transitions. Second operand has 20 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 17 states have internal predecessors, (71), 11 states have call successors, (141), 1 states have call predecessors, (141), 2 states have return successors, (143), 11 states have call predecessors, (143), 11 states have call successors, (143) [2025-03-04 11:35:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:43,986 INFO L93 Difference]: Finished difference Result 111 states and 167 transitions. [2025-03-04 11:35:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:35:43,987 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 17 states have internal predecessors, (71), 11 states have call successors, (141), 1 states have call predecessors, (141), 2 states have return successors, (143), 11 states have call predecessors, (143), 11 states have call successors, (143) Word has length 268 [2025-03-04 11:35:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:43,988 INFO L225 Difference]: With dead ends: 111 [2025-03-04 11:35:43,988 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 11:35:43,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:35:43,989 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 51 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:43,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 968 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 11:35:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2025-03-04 11:35:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 53 states have internal predecessors, (57), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 159 transitions. [2025-03-04 11:35:44,000 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 159 transitions. Word has length 268 [2025-03-04 11:35:44,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:44,001 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 159 transitions. [2025-03-04 11:35:44,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 17 states have internal predecessors, (71), 11 states have call successors, (141), 1 states have call predecessors, (141), 2 states have return successors, (143), 11 states have call predecessors, (143), 11 states have call successors, (143) [2025-03-04 11:35:44,001 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 159 transitions. [2025-03-04 11:35:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-04 11:35:44,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:44,002 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:44,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:44,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 11:35:44,203 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:44,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash -498902687, now seen corresponding path program 1 times [2025-03-04 11:35:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:44,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056408973] [2025-03-04 11:35:44,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:44,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-04 11:35:44,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-04 11:35:44,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:44,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 18 proven. 126 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-03-04 11:35:44,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:44,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056408973] [2025-03-04 11:35:44,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056408973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:44,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964329088] [2025-03-04 11:35:44,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:44,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:44,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:44,328 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:44,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:35:44,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-04 11:35:44,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-04 11:35:44,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:44,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:44,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:44,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 18 proven. 126 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-03-04 11:35:44,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 18 proven. 126 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-03-04 11:35:44,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964329088] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:44,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:44,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 11:35:44,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907061243] [2025-03-04 11:35:44,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:44,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:35:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:44,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:35:44,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:44,743 INFO L87 Difference]: Start difference. First operand 106 states and 159 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (91), 1 states have call predecessors, (91), 2 states have return successors, (92), 4 states have call predecessors, (92), 4 states have call successors, (92) [2025-03-04 11:35:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:44,893 INFO L93 Difference]: Finished difference Result 106 states and 159 transitions. [2025-03-04 11:35:44,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:44,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (91), 1 states have call predecessors, (91), 2 states have return successors, (92), 4 states have call predecessors, (92), 4 states have call successors, (92) Word has length 269 [2025-03-04 11:35:44,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:44,895 INFO L225 Difference]: With dead ends: 106 [2025-03-04 11:35:44,895 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 11:35:44,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 534 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:44,895 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:44,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 378 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:44,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 11:35:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-04 11:35:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 52 states have internal predecessors, (56), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2025-03-04 11:35:44,904 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 269 [2025-03-04 11:35:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:44,905 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2025-03-04 11:35:44,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (91), 1 states have call predecessors, (91), 2 states have return successors, (92), 4 states have call predecessors, (92), 4 states have call successors, (92) [2025-03-04 11:35:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2025-03-04 11:35:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-04 11:35:44,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:44,907 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:44,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:45,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 11:35:45,107 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:45,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2071867938, now seen corresponding path program 1 times [2025-03-04 11:35:45,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:45,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383831095] [2025-03-04 11:35:45,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:45,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:45,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-04 11:35:45,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-04 11:35:45,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:45,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 30 proven. 252 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2025-03-04 11:35:45,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:45,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383831095] [2025-03-04 11:35:45,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383831095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:45,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748605669] [2025-03-04 11:35:45,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:45,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:45,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:45,271 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:45,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:35:45,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-04 11:35:45,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-04 11:35:45,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:45,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:45,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:35:45,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 198 proven. 342 refuted. 0 times theorem prover too weak. 4164 trivial. 0 not checked. [2025-03-04 11:35:45,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 198 proven. 342 refuted. 0 times theorem prover too weak. 4164 trivial. 0 not checked. [2025-03-04 11:35:45,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748605669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:45,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:45,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 22 [2025-03-04 11:35:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510952388] [2025-03-04 11:35:45,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:45,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 11:35:45,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:45,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 11:35:45,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:35:45,957 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand has 23 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 23 states have internal predecessors, (83), 11 states have call successors, (141), 1 states have call predecessors, (141), 2 states have return successors, (143), 11 states have call predecessors, (143), 11 states have call successors, (143) [2025-03-04 11:35:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:46,466 INFO L93 Difference]: Finished difference Result 109 states and 163 transitions. [2025-03-04 11:35:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:46,466 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 23 states have internal predecessors, (83), 11 states have call successors, (141), 1 states have call predecessors, (141), 2 states have return successors, (143), 11 states have call predecessors, (143), 11 states have call successors, (143) Word has length 272 [2025-03-04 11:35:46,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:46,467 INFO L225 Difference]: With dead ends: 109 [2025-03-04 11:35:46,467 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 11:35:46,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:35:46,468 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 81 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:46,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 907 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:46,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 11:35:46,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-03-04 11:35:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 51 states have internal predecessors, (55), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2025-03-04 11:35:46,475 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 157 transitions. Word has length 272 [2025-03-04 11:35:46,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:46,475 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 157 transitions. [2025-03-04 11:35:46,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 23 states have internal predecessors, (83), 11 states have call successors, (141), 1 states have call predecessors, (141), 2 states have return successors, (143), 11 states have call predecessors, (143), 11 states have call successors, (143) [2025-03-04 11:35:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 157 transitions. [2025-03-04 11:35:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-04 11:35:46,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:46,476 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:46,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:46,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:35:46,681 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:46,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:46,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1777124719, now seen corresponding path program 1 times [2025-03-04 11:35:46,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:46,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700849991] [2025-03-04 11:35:46,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:46,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-04 11:35:46,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-04 11:35:46,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:46,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 18 proven. 129 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 11:35:46,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:46,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700849991] [2025-03-04 11:35:46,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700849991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:46,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312223770] [2025-03-04 11:35:46,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:46,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:46,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:46,825 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:46,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:35:46,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-04 11:35:46,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-04 11:35:46,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:46,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:46,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:46,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 18 proven. 129 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 11:35:47,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 18 proven. 129 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 11:35:47,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312223770] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:47,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:47,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:47,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516966620] [2025-03-04 11:35:47,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:47,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:47,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:47,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:47,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:47,247 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 6 states have call successors, (135), 1 states have call predecessors, (135), 2 states have return successors, (136), 6 states have call predecessors, (136), 6 states have call successors, (136) [2025-03-04 11:35:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:47,472 INFO L93 Difference]: Finished difference Result 104 states and 157 transitions. [2025-03-04 11:35:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:47,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 6 states have call successors, (135), 1 states have call predecessors, (135), 2 states have return successors, (136), 6 states have call predecessors, (136), 6 states have call successors, (136) Word has length 277 [2025-03-04 11:35:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:47,475 INFO L225 Difference]: With dead ends: 104 [2025-03-04 11:35:47,475 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 11:35:47,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:47,476 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 20 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:47,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 372 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 11:35:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 11:35:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 46 states have (on average 1.173913043478261) internal successors, (54), 50 states have internal predecessors, (54), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 156 transitions. [2025-03-04 11:35:47,484 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 156 transitions. Word has length 277 [2025-03-04 11:35:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:47,486 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 156 transitions. [2025-03-04 11:35:47,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 6 states have call successors, (135), 1 states have call predecessors, (135), 2 states have return successors, (136), 6 states have call predecessors, (136), 6 states have call successors, (136) [2025-03-04 11:35:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 156 transitions. [2025-03-04 11:35:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-04 11:35:47,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:47,488 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:47,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:35:47,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 11:35:47,692 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:47,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:47,692 INFO L85 PathProgramCache]: Analyzing trace with hash -743708565, now seen corresponding path program 1 times [2025-03-04 11:35:47,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:47,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722807871] [2025-03-04 11:35:47,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:47,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:47,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-04 11:35:47,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-04 11:35:47,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:47,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 24 proven. 123 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 11:35:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722807871] [2025-03-04 11:35:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722807871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955805082] [2025-03-04 11:35:47,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:47,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:47,826 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:47,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:35:47,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-04 11:35:47,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-04 11:35:47,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:47,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:47,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:47,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 24 proven. 123 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 11:35:48,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 24 proven. 123 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 11:35:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955805082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:48,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:48,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-04 11:35:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831373215] [2025-03-04 11:35:48,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:48,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:35:48,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:48,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:35:48,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:35:48,270 INFO L87 Difference]: Start difference. First operand 103 states and 156 transitions. Second operand has 11 states, 10 states have (on average 8.0) internal successors, (80), 11 states have internal predecessors, (80), 6 states have call successors, (136), 1 states have call predecessors, (136), 2 states have return successors, (137), 6 states have call predecessors, (137), 6 states have call successors, (137) [2025-03-04 11:35:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:48,521 INFO L93 Difference]: Finished difference Result 103 states and 156 transitions. [2025-03-04 11:35:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:35:48,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.0) internal successors, (80), 11 states have internal predecessors, (80), 6 states have call successors, (136), 1 states have call predecessors, (136), 2 states have return successors, (137), 6 states have call predecessors, (137), 6 states have call successors, (137) Word has length 278 [2025-03-04 11:35:48,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:48,523 INFO L225 Difference]: With dead ends: 103 [2025-03-04 11:35:48,523 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 11:35:48,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 551 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:35:48,523 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:48,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 524 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 11:35:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-04 11:35:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-03-04 11:35:48,531 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 278 [2025-03-04 11:35:48,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:48,531 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-03-04 11:35:48,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.0) internal successors, (80), 11 states have internal predecessors, (80), 6 states have call successors, (136), 1 states have call predecessors, (136), 2 states have return successors, (137), 6 states have call predecessors, (137), 6 states have call successors, (137) [2025-03-04 11:35:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-03-04 11:35:48,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-04 11:35:48,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:48,532 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:48,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:35:48,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:35:48,737 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:48,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:48,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1914413132, now seen corresponding path program 1 times [2025-03-04 11:35:48,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:48,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279422006] [2025-03-04 11:35:48,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:48,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:48,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-04 11:35:48,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-04 11:35:48,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:48,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 18 proven. 129 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 11:35:48,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:48,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279422006] [2025-03-04 11:35:48,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279422006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:48,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331515748] [2025-03-04 11:35:48,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:48,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:48,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:48,884 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:48,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:35:48,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-04 11:35:48,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-04 11:35:48,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:48,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:48,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:35:48,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 18 proven. 129 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 11:35:49,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 18 proven. 129 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 11:35:49,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331515748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:49,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:49,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-04 11:35:49,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548143506] [2025-03-04 11:35:49,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:49,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:35:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:49,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:35:49,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:49,342 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (92), 1 states have call predecessors, (92), 2 states have return successors, (92), 4 states have call predecessors, (92), 4 states have call successors, (92) [2025-03-04 11:35:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:49,602 INFO L93 Difference]: Finished difference Result 102 states and 155 transitions. [2025-03-04 11:35:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:35:49,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (92), 1 states have call predecessors, (92), 2 states have return successors, (92), 4 states have call predecessors, (92), 4 states have call successors, (92) Word has length 281 [2025-03-04 11:35:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:49,603 INFO L225 Difference]: With dead ends: 102 [2025-03-04 11:35:49,603 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 11:35:49,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 557 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:49,604 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 9 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:49,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 472 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 11:35:49,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 11:35:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 48 states have internal predecessors, (52), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 154 transitions. [2025-03-04 11:35:49,610 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 154 transitions. Word has length 281 [2025-03-04 11:35:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:49,611 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 154 transitions. [2025-03-04 11:35:49,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (92), 1 states have call predecessors, (92), 2 states have return successors, (92), 4 states have call predecessors, (92), 4 states have call successors, (92) [2025-03-04 11:35:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 154 transitions. [2025-03-04 11:35:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 11:35:49,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:49,612 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:49,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:49,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:35:49,812 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:49,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:49,813 INFO L85 PathProgramCache]: Analyzing trace with hash 457185137, now seen corresponding path program 1 times [2025-03-04 11:35:49,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:49,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064773670] [2025-03-04 11:35:49,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:49,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:49,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 11:35:49,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 11:35:49,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:49,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 24 proven. 126 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-03-04 11:35:49,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:49,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064773670] [2025-03-04 11:35:49,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064773670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:49,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330796369] [2025-03-04 11:35:49,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:49,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:49,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:49,942 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:49,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:35:49,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 11:35:50,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 11:35:50,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:50,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:50,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:50,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 24 proven. 126 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-03-04 11:35:50,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 24 proven. 126 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-03-04 11:35:50,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330796369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:50,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:50,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091864699] [2025-03-04 11:35:50,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:50,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:50,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:50,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:50,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:50,405 INFO L87 Difference]: Start difference. First operand 101 states and 154 transitions. Second operand has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 6 states have call successors, (134), 1 states have call predecessors, (134), 2 states have return successors, (135), 6 states have call predecessors, (135), 6 states have call successors, (135) [2025-03-04 11:35:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:50,568 INFO L93 Difference]: Finished difference Result 101 states and 154 transitions. [2025-03-04 11:35:50,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:50,568 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 6 states have call successors, (134), 1 states have call predecessors, (134), 2 states have return successors, (135), 6 states have call predecessors, (135), 6 states have call successors, (135) Word has length 286 [2025-03-04 11:35:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:50,570 INFO L225 Difference]: With dead ends: 101 [2025-03-04 11:35:50,570 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 11:35:50,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:50,570 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 39 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:50,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 363 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 11:35:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 11:35:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 46 states have (on average 1.108695652173913) internal successors, (51), 47 states have internal predecessors, (51), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 153 transitions. [2025-03-04 11:35:50,579 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 153 transitions. Word has length 286 [2025-03-04 11:35:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:50,580 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 153 transitions. [2025-03-04 11:35:50,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 6 states have call successors, (134), 1 states have call predecessors, (134), 2 states have return successors, (135), 6 states have call predecessors, (135), 6 states have call successors, (135) [2025-03-04 11:35:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 153 transitions. [2025-03-04 11:35:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-04 11:35:50,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:50,582 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:50,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:35:50,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:50,782 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:50,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:50,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1287837341, now seen corresponding path program 1 times [2025-03-04 11:35:50,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:50,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811807843] [2025-03-04 11:35:50,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:50,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:50,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 11:35:50,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 11:35:50,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:50,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 30 proven. 120 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-03-04 11:35:50,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:50,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811807843] [2025-03-04 11:35:50,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811807843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:50,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487271246] [2025-03-04 11:35:50,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:50,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:50,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:50,945 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:50,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:35:50,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 11:35:51,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 11:35:51,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:51,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:51,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:51,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 30 proven. 120 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-03-04 11:35:51,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 30 proven. 120 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-03-04 11:35:51,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487271246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:51,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:51,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-03-04 11:35:51,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668095832] [2025-03-04 11:35:51,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:35:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:51,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:35:51,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:35:51,394 INFO L87 Difference]: Start difference. First operand 100 states and 153 transitions. Second operand has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 7 states have call successors, (137), 1 states have call predecessors, (137), 2 states have return successors, (138), 7 states have call predecessors, (138), 7 states have call successors, (138) [2025-03-04 11:35:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:51,759 INFO L93 Difference]: Finished difference Result 105 states and 160 transitions. [2025-03-04 11:35:51,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:51,760 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 7 states have call successors, (137), 1 states have call predecessors, (137), 2 states have return successors, (138), 7 states have call predecessors, (138), 7 states have call successors, (138) Word has length 287 [2025-03-04 11:35:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:51,761 INFO L225 Difference]: With dead ends: 105 [2025-03-04 11:35:51,761 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 11:35:51,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 569 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:35:51,763 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 61 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:51,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 609 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 11:35:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2025-03-04 11:35:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:35:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 152 transitions. [2025-03-04 11:35:51,770 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 152 transitions. Word has length 287 [2025-03-04 11:35:51,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:51,770 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 152 transitions. [2025-03-04 11:35:51,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 7 states have call successors, (137), 1 states have call predecessors, (137), 2 states have return successors, (138), 7 states have call predecessors, (138), 7 states have call successors, (138) [2025-03-04 11:35:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 152 transitions. [2025-03-04 11:35:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-04 11:35:51,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:51,771 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:51,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:35:51,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:35:51,976 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-04 11:35:51,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:51,976 INFO L85 PathProgramCache]: Analyzing trace with hash -980648370, now seen corresponding path program 1 times [2025-03-04 11:35:51,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:51,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306469741] [2025-03-04 11:35:51,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:51,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:51,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-04 11:35:51,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-04 11:35:51,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:51,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 54 proven. 240 refuted. 0 times theorem prover too weak. 4806 trivial. 0 not checked. [2025-03-04 11:35:52,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:52,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306469741] [2025-03-04 11:35:52,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306469741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:52,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533243241] [2025-03-04 11:35:52,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:52,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:52,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:52,132 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:52,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:35:52,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-04 11:35:52,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-04 11:35:52,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:52,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:52,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:35:52,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 240 proven. 324 refuted. 0 times theorem prover too weak. 4536 trivial. 0 not checked. [2025-03-04 11:35:52,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 240 proven. 324 refuted. 0 times theorem prover too weak. 4536 trivial. 0 not checked. [2025-03-04 11:35:52,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533243241] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:52,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:52,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 22 [2025-03-04 11:35:52,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164801951] [2025-03-04 11:35:52,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:52,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 11:35:52,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:52,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 11:35:52,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:35:52,840 INFO L87 Difference]: Start difference. First operand 99 states and 152 transitions. Second operand has 23 states, 21 states have (on average 4.904761904761905) internal successors, (103), 23 states have internal predecessors, (103), 11 states have call successors, (139), 1 states have call predecessors, (139), 2 states have return successors, (141), 11 states have call predecessors, (141), 11 states have call successors, (141) [2025-03-04 11:35:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:53,266 INFO L93 Difference]: Finished difference Result 103 states and 157 transitions. [2025-03-04 11:35:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:53,267 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.904761904761905) internal successors, (103), 23 states have internal predecessors, (103), 11 states have call successors, (139), 1 states have call predecessors, (139), 2 states have return successors, (141), 11 states have call predecessors, (141), 11 states have call successors, (141) Word has length 290 [2025-03-04 11:35:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:53,267 INFO L225 Difference]: With dead ends: 103 [2025-03-04 11:35:53,267 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:35:53,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:35:53,268 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 148 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:53,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 799 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:35:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:35:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:35:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:35:53,269 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 290 [2025-03-04 11:35:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:53,269 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:35:53,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.904761904761905) internal successors, (103), 23 states have internal predecessors, (103), 11 states have call successors, (139), 1 states have call predecessors, (139), 2 states have return successors, (141), 11 states have call predecessors, (141), 11 states have call successors, (141) [2025-03-04 11:35:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:35:53,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:35:53,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2025-03-04 11:35:53,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2025-03-04 11:35:53,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2025-03-04 11:35:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2025-03-04 11:35:53,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 11:35:53,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:35:53,475 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:53,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:35:54,272 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:35:54,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:35:54 BoogieIcfgContainer [2025-03-04 11:35:54,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:35:54,276 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:35:54,277 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:35:54,277 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:35:54,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:34" (3/4) ... [2025-03-04 11:35:54,278 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:35:54,283 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume [2025-03-04 11:35:54,287 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:35:54,287 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:35:54,288 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:35:54,288 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:35:54,349 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:35:54,349 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:35:54,349 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:35:54,350 INFO L158 Benchmark]: Toolchain (without parser) took 20914.70ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 112.1MB in the beginning and 216.2MB in the end (delta: -104.1MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2025-03-04 11:35:54,350 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:35:54,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.34ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 100.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:35:54,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.73ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:35:54,350 INFO L158 Benchmark]: Boogie Preprocessor took 40.29ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:35:54,351 INFO L158 Benchmark]: IcfgBuilder took 322.18ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 78.0MB in the end (delta: 19.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:35:54,351 INFO L158 Benchmark]: TraceAbstraction took 20270.26ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 77.1MB in the beginning and 220.8MB in the end (delta: -143.7MB). Peak memory consumption was 165.8MB. Max. memory is 16.1GB. [2025-03-04 11:35:54,351 INFO L158 Benchmark]: Witness Printer took 72.81ms. Allocated memory is still 327.2MB. Free memory was 220.8MB in the beginning and 216.2MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:35:54,352 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.38ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.34ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 100.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.73ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.29ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 322.18ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 78.0MB in the end (delta: 19.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20270.26ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 77.1MB in the beginning and 220.8MB in the end (delta: -143.7MB). Peak memory consumption was 165.8MB. Max. memory is 16.1GB. * Witness Printer took 72.81ms. Allocated memory is still 327.2MB. Free memory was 220.8MB in the beginning and 216.2MB in the end (delta: 4.6MB). 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: 111]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 111]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: 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 2 procedures, 125 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 17, TraceHistogramMax: 51, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 502 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 502 mSDsluCounter, 8915 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7117 mSDsCounter, 357 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7008 IncrementalHoareTripleChecker+Invalid, 7365 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 357 mSolverCounterUnsat, 1798 mSDtfsCounter, 7008 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8445 GetRequests, 8238 SyntacticMatches, 10 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 8843 NumberOfCodeBlocks, 8843 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 12840 ConstructedInterpolants, 0 QuantifiedInterpolants, 28841 SizeOfPredicates, 24 NumberOfNonLiveVariables, 8127 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 48 InterpolantComputations, 2 PerfectInterpolantSequences, 217297/224832 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 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 11:35:54,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE