./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-bwb/and-02-false.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-bwb/and-02-false.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash c6684a8ca2453ef662366f4da66fbb75d23a4edf014c7205fa9be4e6b0c90683 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:26:22,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:26:22,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:26:22,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:26:22,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:26:22,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:26:22,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:26:22,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:26:22,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:26:22,109 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:26:22,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:26:22,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:26:22,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:26:22,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:26:22,109 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:26:22,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:26:22,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:26:22,110 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:26:22,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:26:22,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:26:22,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:26:22,111 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6684a8ca2453ef662366f4da66fbb75d23a4edf014c7205fa9be4e6b0c90683 [2025-03-04 10:26:22,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:26:22,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:26:22,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:26:22,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:26:22,361 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:26:22,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/and-02-false.c [2025-03-04 10:26:23,524 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8354494a/d89ac90c9da6413484832c7d8d243295/FLAG9adacf1c9 [2025-03-04 10:26:23,729 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:26:23,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/and-02-false.c [2025-03-04 10:26:23,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8354494a/d89ac90c9da6413484832c7d8d243295/FLAG9adacf1c9 [2025-03-04 10:26:24,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8354494a/d89ac90c9da6413484832c7d8d243295 [2025-03-04 10:26:24,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:26:24,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:26:24,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:26:24,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:26:24,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:26:24,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24, skipping insertion in model container [2025-03-04 10:26:24,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:26:24,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:26:24,195 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:26:24,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:26:24,213 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:26:24,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24 WrapperNode [2025-03-04 10:26:24,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:26:24,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:26:24,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:26:24,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:26:24,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,231 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2025-03-04 10:26:24,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:26:24,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:26:24,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:26:24,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:26:24,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,244 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:26:24,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:26:24,247 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:26:24,248 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:26:24,248 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:26:24,248 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (1/1) ... [2025-03-04 10:26:24,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:26:24,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:24,275 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 10:26:24,280 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 10:26:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:26:24,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:26:24,332 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:26:24,333 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:26:24,420 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 10:26:24,420 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:26:24,431 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:26:24,431 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:26:24,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:26:24 BoogieIcfgContainer [2025-03-04 10:26:24,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:26:24,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:26:24,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:26:24,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:26:24,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:26:24" (1/3) ... [2025-03-04 10:26:24,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f13c75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:26:24, skipping insertion in model container [2025-03-04 10:26:24,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:26:24" (2/3) ... [2025-03-04 10:26:24,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f13c75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:26:24, skipping insertion in model container [2025-03-04 10:26:24,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:26:24" (3/3) ... [2025-03-04 10:26:24,437 INFO L128 eAbstractionObserver]: Analyzing ICFG and-02-false.c [2025-03-04 10:26:24,447 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:26:24,450 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG and-02-false.c that has 1 procedures, 19 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-04 10:26:24,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:26:24,498 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;@c4ec890, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:26:24,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:26:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 10:26:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:26:24,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:24,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:26:24,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:26:24,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:24,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1599743, now seen corresponding path program 1 times [2025-03-04 10:26:24,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:24,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92886197] [2025-03-04 10:26:24,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:24,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:24,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:26:24,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:26:24,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:24,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:24,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:24,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92886197] [2025-03-04 10:26:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92886197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:24,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:24,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419663235] [2025-03-04 10:26:24,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:24,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:24,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:24,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:24,638 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 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 10:26:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:24,677 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-04 10:26:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:24,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 10:26:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:24,682 INFO L225 Difference]: With dead ends: 24 [2025-03-04 10:26:24,682 INFO L226 Difference]: Without dead ends: 19 [2025-03-04 10:26:24,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:24,685 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:24,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-04 10:26:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-03-04 10:26:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.5) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:26:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-03-04 10:26:24,704 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 4 [2025-03-04 10:26:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:24,705 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-04 10:26:24,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 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 10:26:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2025-03-04 10:26:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:26:24,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:24,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:26:24,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:26:24,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:26:24,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash 49592019, now seen corresponding path program 1 times [2025-03-04 10:26:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:24,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843902419] [2025-03-04 10:26:24,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:24,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:26:24,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:26:24,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:24,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:24,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:24,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843902419] [2025-03-04 10:26:24,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843902419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:24,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:24,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:24,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456636025] [2025-03-04 10:26:24,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:24,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:26:24,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:24,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:26:24,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:24,738 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 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 10:26:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:24,760 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2025-03-04 10:26:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:26:24,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 10:26:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:24,763 INFO L225 Difference]: With dead ends: 18 [2025-03-04 10:26:24,763 INFO L226 Difference]: Without dead ends: 17 [2025-03-04 10:26:24,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:26:24,764 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:24,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-04 10:26:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-04 10:26:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:26:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-03-04 10:26:24,768 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 5 [2025-03-04 10:26:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:24,768 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-03-04 10:26:24,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 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 10:26:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-03-04 10:26:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:26:24,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:24,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:24,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:26:24,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:26:24,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:24,771 INFO L85 PathProgramCache]: Analyzing trace with hash 413289489, now seen corresponding path program 1 times [2025-03-04 10:26:24,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:24,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953290947] [2025-03-04 10:26:24,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:24,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:24,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:26:24,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:26:24,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:24,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:24,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:24,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953290947] [2025-03-04 10:26:24,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953290947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:26:24,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:26:24,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:26:24,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055882472] [2025-03-04 10:26:24,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:26:24,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:26:24,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:24,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:26:24,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:24,805 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 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 10:26:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:24,823 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-03-04 10:26:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:26:24,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:26:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:24,823 INFO L225 Difference]: With dead ends: 26 [2025-03-04 10:26:24,824 INFO L226 Difference]: Without dead ends: 13 [2025-03-04 10:26:24,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:26:24,824 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:24,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:26:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-04 10:26:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-04 10:26:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 10:26:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-03-04 10:26:24,829 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2025-03-04 10:26:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:24,829 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-04 10:26:24,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 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 10:26:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-03-04 10:26:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:26:24,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:24,830 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:26:24,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:26:24,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:26:24,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1363411909, now seen corresponding path program 1 times [2025-03-04 10:26:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:24,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404985585] [2025-03-04 10:26:24,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:24,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:24,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:26:24,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:26:24,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:24,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:24,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:24,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404985585] [2025-03-04 10:26:24,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404985585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:24,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283333174] [2025-03-04 10:26:24,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:26:24,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:24,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:24,913 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 10:26:24,914 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 10:26:24,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:26:24,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:26:24,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:26:24,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:24,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:26:24,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:24,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:25,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283333174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:25,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:25,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:26:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800700802] [2025-03-04 10:26:25,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:25,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:26:25,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:25,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:26:25,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:26:25,037 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:26:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:25,096 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2025-03-04 10:26:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:26:25,097 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 10:26:25,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:25,097 INFO L225 Difference]: With dead ends: 38 [2025-03-04 10:26:25,097 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 10:26:25,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:26:25,098 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:25,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 20 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 10:26:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-04 10:26:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 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 10:26:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-03-04 10:26:25,101 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 10 [2025-03-04 10:26:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:25,102 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-03-04 10:26:25,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:26:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-03-04 10:26:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:26:25,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:25,102 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-04 10:26:25,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:26:25,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:25,307 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:26:25,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:25,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1667004433, now seen corresponding path program 2 times [2025-03-04 10:26:25,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:25,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926841092] [2025-03-04 10:26:25,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:26:25,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:25,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:26:25,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:26:25,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:26:25,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:25,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:25,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926841092] [2025-03-04 10:26:25,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926841092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:25,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954195715] [2025-03-04 10:26:25,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:26:25,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:25,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:25,474 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 10:26:25,475 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 10:26:25,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:26:25,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:26:25,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:26:25,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:25,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:26:25,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:25,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:25,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954195715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:25,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:25,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-04 10:26:25,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066693731] [2025-03-04 10:26:25,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:25,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:26:25,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:25,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:26:25,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:26:25,735 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 10:26:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:25,848 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2025-03-04 10:26:25,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:26:25,849 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 10:26:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:25,849 INFO L225 Difference]: With dead ends: 86 [2025-03-04 10:26:25,851 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 10:26:25,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:26:25,852 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 73 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:25,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 40 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:26:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 10:26:25,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-04 10:26:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.25) internal successors, (105), 84 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:26:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2025-03-04 10:26:25,859 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 28 [2025-03-04 10:26:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:25,859 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2025-03-04 10:26:25,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 10:26:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2025-03-04 10:26:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 10:26:25,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:25,862 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 1, 1, 1] [2025-03-04 10:26:25,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:26:26,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:26,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:26:26,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash -706097065, now seen corresponding path program 3 times [2025-03-04 10:26:26,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:26,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709902660] [2025-03-04 10:26:26,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:26:26,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:26,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 11 equivalence classes. [2025-03-04 10:26:26,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 10:26:26,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:26:26,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:26,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:26,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709902660] [2025-03-04 10:26:26,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709902660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:26,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102917567] [2025-03-04 10:26:26,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:26:26,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:26,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:26,523 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 10:26:26,524 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 10:26:26,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 11 equivalence classes. [2025-03-04 10:26:26,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 10:26:26,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:26:26,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:26,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:26:26,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:26,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:27,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102917567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:27,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:27,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-03-04 10:26:27,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308880720] [2025-03-04 10:26:27,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:27,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 10:26:27,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:27,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 10:26:27,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 10:26:27,163 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 46 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 10:26:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:27,382 INFO L93 Difference]: Finished difference Result 182 states and 237 transitions. [2025-03-04 10:26:27,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 10:26:27,383 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 46 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-04 10:26:27,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:27,384 INFO L225 Difference]: With dead ends: 182 [2025-03-04 10:26:27,386 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 10:26:27,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 10:26:27,387 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 289 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:27,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 60 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:26:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 10:26:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-04 10:26:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.25) internal successors, (225), 180 states have internal predecessors, (225), 0 states have call successors, (0), 0 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 10:26:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 225 transitions. [2025-03-04 10:26:27,400 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 225 transitions. Word has length 64 [2025-03-04 10:26:27,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:27,401 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 225 transitions. [2025-03-04 10:26:27,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 46 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 10:26:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 225 transitions. [2025-03-04 10:26:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 10:26:27,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:27,405 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 1, 1, 1] [2025-03-04 10:26:27,411 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 10:26:27,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:27,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:26:27,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash 753804583, now seen corresponding path program 4 times [2025-03-04 10:26:27,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:27,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124572283] [2025-03-04 10:26:27,608 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:26:27,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:27,616 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 136 statements into 2 equivalence classes. [2025-03-04 10:26:27,639 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 10:26:27,639 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:26:27,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:28,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124572283] [2025-03-04 10:26:28,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124572283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:28,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061105501] [2025-03-04 10:26:28,834 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:26:28,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:28,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:28,836 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 10:26:28,837 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 10:26:28,869 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 136 statements into 2 equivalence classes. [2025-03-04 10:26:28,899 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 10:26:28,900 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:26:28,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:28,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 10:26:28,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:29,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:30,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061105501] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:30,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:30,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 95 [2025-03-04 10:26:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649822916] [2025-03-04 10:26:30,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:30,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-04 10:26:30,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:30,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-04 10:26:30,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 10:26:30,627 INFO L87 Difference]: Start difference. First operand 181 states and 225 transitions. Second operand has 96 states, 95 states have (on average 2.8947368421052633) internal successors, (275), 96 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:26:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:31,050 INFO L93 Difference]: Finished difference Result 563 states and 727 transitions. [2025-03-04 10:26:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-03-04 10:26:31,051 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 2.8947368421052633) internal successors, (275), 96 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-04 10:26:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:31,053 INFO L225 Difference]: With dead ends: 563 [2025-03-04 10:26:31,053 INFO L226 Difference]: Without dead ends: 562 [2025-03-04 10:26:31,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 10:26:31,056 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 451 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:31,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 119 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:26:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-04 10:26:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 371. [2025-03-04 10:26:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.2486486486486486) internal successors, (462), 370 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 10:26:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 462 transitions. [2025-03-04 10:26:31,078 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 462 transitions. Word has length 136 [2025-03-04 10:26:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:31,078 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 462 transitions. [2025-03-04 10:26:31,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 2.8947368421052633) internal successors, (275), 96 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:26:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 462 transitions. [2025-03-04 10:26:31,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-04 10:26:31,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:31,081 INFO L218 NwaCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 1, 1, 1] [2025-03-04 10:26:31,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:26:31,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:31,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:26:31,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:31,286 INFO L85 PathProgramCache]: Analyzing trace with hash 590208711, now seen corresponding path program 5 times [2025-03-04 10:26:31,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:31,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680493559] [2025-03-04 10:26:31,286 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:26:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:31,296 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 280 statements into 47 equivalence classes. [2025-03-04 10:26:31,423 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 280 of 280 statements. [2025-03-04 10:26:31,423 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:26:31,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:34,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:34,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680493559] [2025-03-04 10:26:34,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680493559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:34,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737240259] [2025-03-04 10:26:34,872 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:26:34,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:34,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:34,875 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 10:26:34,876 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 10:26:34,915 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 280 statements into 47 equivalence classes. [2025-03-04 10:26:35,033 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 280 of 280 statements. [2025-03-04 10:26:35,033 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:26:35,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:35,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-04 10:26:35,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:35,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:26:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:40,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737240259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:26:40,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:26:40,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2025-03-04 10:26:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838021412] [2025-03-04 10:26:40,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:26:40,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2025-03-04 10:26:40,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:26:40,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2025-03-04 10:26:40,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-03-04 10:26:40,311 INFO L87 Difference]: Start difference. First operand 371 states and 462 transitions. Second operand has 190 states, 189 states have (on average 2.9576719576719577) internal successors, (559), 190 states have internal predecessors, (559), 0 states have call successors, (0), 0 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 10:26:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:26:41,872 INFO L93 Difference]: Finished difference Result 756 states and 990 transitions. [2025-03-04 10:26:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-03-04 10:26:41,872 INFO L78 Accepts]: Start accepts. Automaton has has 190 states, 189 states have (on average 2.9576719576719577) internal successors, (559), 190 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 280 [2025-03-04 10:26:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:26:41,875 INFO L225 Difference]: With dead ends: 756 [2025-03-04 10:26:41,875 INFO L226 Difference]: Without dead ends: 755 [2025-03-04 10:26:41,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10765 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-03-04 10:26:41,878 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 1448 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:26:41,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 223 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:26:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-03-04 10:26:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2025-03-04 10:26:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 754 states have (on average 1.2493368700265253) internal successors, (942), 754 states have internal predecessors, (942), 0 states have call successors, (0), 0 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 10:26:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 942 transitions. [2025-03-04 10:26:41,898 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 942 transitions. Word has length 280 [2025-03-04 10:26:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:26:41,898 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 942 transitions. [2025-03-04 10:26:41,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 189 states have (on average 2.9576719576719577) internal successors, (559), 190 states have internal predecessors, (559), 0 states have call successors, (0), 0 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 10:26:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 942 transitions. [2025-03-04 10:26:41,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-04 10:26:41,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:26:41,906 INFO L218 NwaCegarLoop]: trace histogram [95, 94, 94, 94, 94, 94, 1, 1, 1] [2025-03-04 10:26:41,914 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 10:26:42,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:42,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:26:42,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:26:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash -79064569, now seen corresponding path program 6 times [2025-03-04 10:26:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:26:42,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335775790] [2025-03-04 10:26:42,111 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:26:42,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:26:42,124 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 568 statements into 95 equivalence classes. [2025-03-04 10:26:42,308 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 10:26:42,308 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-04 10:26:42,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 26414 backedges. 0 proven. 26414 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:55,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:26:55,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335775790] [2025-03-04 10:26:55,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335775790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:26:55,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779671869] [2025-03-04 10:26:55,271 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:26:55,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:26:55,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:26:55,272 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 10:26:55,273 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 10:26:55,324 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 568 statements into 95 equivalence classes. [2025-03-04 10:26:55,602 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 10:26:55,602 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-04 10:26:55,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:26:55,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 191 conjuncts are in the unsatisfiable core [2025-03-04 10:26:55,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:26:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 26414 backedges. 0 proven. 26414 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:26:56,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:27:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 26414 backedges. 0 proven. 26414 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:27:15,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779671869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:27:15,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:27:15,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191, 191] total 381 [2025-03-04 10:27:15,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492684742] [2025-03-04 10:27:15,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:27:15,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 382 states [2025-03-04 10:27:15,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:27:15,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 382 interpolants. [2025-03-04 10:27:15,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36671, Invalid=108871, Unknown=0, NotChecked=0, Total=145542 [2025-03-04 10:27:15,253 INFO L87 Difference]: Start difference. First operand 755 states and 942 transitions. Second operand has 382 states, 381 states have (on average 2.979002624671916) internal successors, (1135), 382 states have internal predecessors, (1135), 0 states have call successors, (0), 0 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 10:27:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:27:32,711 INFO L93 Difference]: Finished difference Result 1524 states and 1998 transitions. [2025-03-04 10:27:32,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 382 states. [2025-03-04 10:27:32,712 INFO L78 Accepts]: Start accepts. Automaton has has 382 states, 381 states have (on average 2.979002624671916) internal successors, (1135), 382 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 568 [2025-03-04 10:27:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:27:32,717 INFO L225 Difference]: With dead ends: 1524 [2025-03-04 10:27:32,717 INFO L226 Difference]: Without dead ends: 1523 [2025-03-04 10:27:32,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1325 GetRequests, 945 SyntacticMatches, 0 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44557 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=36671, Invalid=108871, Unknown=0, NotChecked=0, Total=145542 [2025-03-04 10:27:32,724 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 3076 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3076 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:27:32,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3076 Valid, 420 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 10:27:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-03-04 10:27:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1523. [2025-03-04 10:27:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.2496714848883048) internal successors, (1902), 1522 states have internal predecessors, (1902), 0 states have call successors, (0), 0 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 10:27:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1902 transitions. [2025-03-04 10:27:32,748 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1902 transitions. Word has length 568 [2025-03-04 10:27:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:27:32,748 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 1902 transitions. [2025-03-04 10:27:32,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 382 states, 381 states have (on average 2.979002624671916) internal successors, (1135), 382 states have internal predecessors, (1135), 0 states have call successors, (0), 0 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 10:27:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1902 transitions. [2025-03-04 10:27:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1145 [2025-03-04 10:27:32,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:27:32,771 INFO L218 NwaCegarLoop]: trace histogram [191, 190, 190, 190, 190, 190, 1, 1, 1] [2025-03-04 10:27:32,780 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 10:27:32,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:27:32,972 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:27:32,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:27:32,973 INFO L85 PathProgramCache]: Analyzing trace with hash 804386951, now seen corresponding path program 7 times [2025-03-04 10:27:32,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:27:32,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734426031] [2025-03-04 10:27:32,973 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:27:32,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:27:32,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1144 statements into 1 equivalence classes. [2025-03-04 10:27:33,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1144 of 1144 statements. [2025-03-04 10:27:33,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:27:33,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat