./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-nla/cohencu2-both-nt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-nla/cohencu2-both-nt.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2817f3084a8852f4b330f9c6d3e372001677288c6bd96843f93de200f3970ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:51:59,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:51:59,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:51:59,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:51:59,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:51:59,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:51:59,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:51:59,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:51:59,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:51:59,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:51:59,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:51:59,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:51:59,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:51:59,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:51:59,371 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:51:59,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:51:59,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:51:59,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:51:59,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:51:59,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:51:59,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:51:59,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:51:59,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:51:59,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:51:59,374 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:51:59,374 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:51:59,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:51:59,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:51:59,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:51:59,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:51:59,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:51:59,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:51:59,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:51:59,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:51:59,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:51:59,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:51:59,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:51:59,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:51:59,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:51:59,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:51:59,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:51:59,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:51:59,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:51:59,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:51:59,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:51:59,376 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2817f3084a8852f4b330f9c6d3e372001677288c6bd96843f93de200f3970ca [2025-03-17 14:51:59,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:51:59,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:51:59,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:51:59,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:51:59,617 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:51:59,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-nla/cohencu2-both-nt.c [2025-03-17 14:52:00,791 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17436cfd4/e6ef40f5426c48dea5b36c716ec19239/FLAG99e9366e0 [2025-03-17 14:52:01,031 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:52:01,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-nla/cohencu2-both-nt.c [2025-03-17 14:52:01,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17436cfd4/e6ef40f5426c48dea5b36c716ec19239/FLAG99e9366e0 [2025-03-17 14:52:01,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17436cfd4/e6ef40f5426c48dea5b36c716ec19239 [2025-03-17 14:52:01,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:52:01,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:52:01,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:52:01,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:52:01,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:52:01,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2981bc46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01, skipping insertion in model container [2025-03-17 14:52:01,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:52:01,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:52:01,190 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:52:01,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:52:01,210 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:52:01,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01 WrapperNode [2025-03-17 14:52:01,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:52:01,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:52:01,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:52:01,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:52:01,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,232 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2025-03-17 14:52:01,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:52:01,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:52:01,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:52:01,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:52:01,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,241 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 14:52:01,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:52:01,245 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:52:01,245 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:52:01,245 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:52:01,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (1/1) ... [2025-03-17 14:52:01,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:52:01,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:01,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:52:01,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:52:01,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:52:01,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:52:01,325 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:52:01,327 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:52:01,468 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-17 14:52:01,468 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:52:01,474 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:52:01,475 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:52:01,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:52:01 BoogieIcfgContainer [2025-03-17 14:52:01,475 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:52:01,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:52:01,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:52:01,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:52:01,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:52:01" (1/3) ... [2025-03-17 14:52:01,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4430e319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:52:01, skipping insertion in model container [2025-03-17 14:52:01,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:01" (2/3) ... [2025-03-17 14:52:01,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4430e319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:52:01, skipping insertion in model container [2025-03-17 14:52:01,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:52:01" (3/3) ... [2025-03-17 14:52:01,482 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu2-both-nt.c [2025-03-17 14:52:01,492 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:52:01,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu2-both-nt.c that has 1 procedures, 41 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-03-17 14:52:01,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:52:01,545 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;@4460f7be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:52:01,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 14:52:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 14:52:01,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:01,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 14:52:01,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:01,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:01,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2239, now seen corresponding path program 1 times [2025-03-17 14:52:01,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:01,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725945814] [2025-03-17 14:52:01,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:01,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:52:01,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:52:01,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:01,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:01,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:01,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725945814] [2025-03-17 14:52:01,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725945814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:01,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:01,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:01,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838917676] [2025-03-17 14:52:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:01,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:01,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:01,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:01,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:01,674 INFO L87 Difference]: Start difference. First operand has 41 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:01,719 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2025-03-17 14:52:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:01,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 14:52:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:01,724 INFO L225 Difference]: With dead ends: 44 [2025-03-17 14:52:01,724 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 14:52:01,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:01,727 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:01,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 16 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 14:52:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 14:52:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.6) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2025-03-17 14:52:01,748 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 2 [2025-03-17 14:52:01,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:01,748 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2025-03-17 14:52:01,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2025-03-17 14:52:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 14:52:01,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:01,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 14:52:01,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:52:01,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:01,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash 69414, now seen corresponding path program 1 times [2025-03-17 14:52:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:01,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454429616] [2025-03-17 14:52:01,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:01,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:52:01,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:52:01,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:01,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:01,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:01,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454429616] [2025-03-17 14:52:01,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454429616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:01,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:01,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:01,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649911995] [2025-03-17 14:52:01,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:01,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:01,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:01,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:01,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:01,786 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:01,836 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-03-17 14:52:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:01,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-03-17 14:52:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:01,837 INFO L225 Difference]: With dead ends: 48 [2025-03-17 14:52:01,838 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 14:52:01,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:01,839 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:01,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 14:52:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-17 14:52:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2025-03-17 14:52:01,846 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 3 [2025-03-17 14:52:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:01,846 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2025-03-17 14:52:01,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2025-03-17 14:52:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:52:01,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:01,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:52:01,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:52:01,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:01,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:01,848 INFO L85 PathProgramCache]: Analyzing trace with hash 66706948, now seen corresponding path program 1 times [2025-03-17 14:52:01,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:01,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933613025] [2025-03-17 14:52:01,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:01,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:01,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:52:01,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:52:01,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:01,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:52:01,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [589657109] [2025-03-17 14:52:01,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:01,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:01,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:01,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:01,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:52:01,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:52:01,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:52:01,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:01,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:01,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:52:01,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:01,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:52:01,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:01,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933613025] [2025-03-17 14:52:01,907 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:52:01,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589657109] [2025-03-17 14:52:01,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589657109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:01,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:01,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:01,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490945961] [2025-03-17 14:52:01,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:01,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:01,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:01,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:01,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:01,908 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-17 14:52:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:01,948 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2025-03-17 14:52:01,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:01,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-17 14:52:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:01,949 INFO L225 Difference]: With dead ends: 48 [2025-03-17 14:52:01,949 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 14:52:01,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:01,950 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:01,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 31 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 14:52:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-17 14:52:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 44 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-17 14:52:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2025-03-17 14:52:01,954 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 5 [2025-03-17 14:52:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:01,955 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2025-03-17 14:52:01,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-17 14:52:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2025-03-17 14:52:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:52:01,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:01,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:01,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:02,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:02,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:02,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:02,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1937102758, now seen corresponding path program 1 times [2025-03-17 14:52:02,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:02,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108527711] [2025-03-17 14:52:02,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:02,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:52:02,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:52:02,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:02,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:02,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:02,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108527711] [2025-03-17 14:52:02,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108527711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:02,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:02,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:02,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701023739] [2025-03-17 14:52:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:02,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:02,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:02,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:02,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:02,215 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 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-17 14:52:02,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:02,231 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2025-03-17 14:52:02,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:02,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 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) Word has length 15 [2025-03-17 14:52:02,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:02,232 INFO L225 Difference]: With dead ends: 48 [2025-03-17 14:52:02,232 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 14:52:02,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:02,233 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:02,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 50 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 14:52:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-03-17 14:52:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2025-03-17 14:52:02,237 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 15 [2025-03-17 14:52:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:02,237 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2025-03-17 14:52:02,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 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-17 14:52:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2025-03-17 14:52:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 14:52:02,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:02,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:02,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:52:02,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:02,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:02,238 INFO L85 PathProgramCache]: Analyzing trace with hash 79356625, now seen corresponding path program 1 times [2025-03-17 14:52:02,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:02,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536410634] [2025-03-17 14:52:02,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:02,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:02,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:52:02,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:52:02,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:02,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:02,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:02,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536410634] [2025-03-17 14:52:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536410634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:02,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:02,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:02,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732510030] [2025-03-17 14:52:02,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:02,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:02,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:02,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:02,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:02,278 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:02,296 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2025-03-17 14:52:02,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:02,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 14:52:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:02,297 INFO L225 Difference]: With dead ends: 48 [2025-03-17 14:52:02,298 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 14:52:02,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:02,299 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:02,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 14:52:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 14:52:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 46 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2025-03-17 14:52:02,303 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 16 [2025-03-17 14:52:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:02,303 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2025-03-17 14:52:02,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2025-03-17 14:52:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 14:52:02,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:02,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:02,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:52:02,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:02,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:02,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1834911944, now seen corresponding path program 1 times [2025-03-17 14:52:02,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:02,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444095276] [2025-03-17 14:52:02,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:02,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:02,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:52:02,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:52:02,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:02,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:02,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:02,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444095276] [2025-03-17 14:52:02,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444095276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:02,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:02,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764650642] [2025-03-17 14:52:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:02,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:02,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:02,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:02,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:02,352 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:02,386 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2025-03-17 14:52:02,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:02,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2025-03-17 14:52:02,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:02,387 INFO L225 Difference]: With dead ends: 50 [2025-03-17 14:52:02,387 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 14:52:02,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:02,388 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:02,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 14:52:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-03-17 14:52:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2025-03-17 14:52:02,391 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 17 [2025-03-17 14:52:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:02,391 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2025-03-17 14:52:02,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2025-03-17 14:52:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:52:02,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:02,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:02,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:52:02,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:02,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1047695441, now seen corresponding path program 1 times [2025-03-17 14:52:02,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:02,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608263206] [2025-03-17 14:52:02,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:02,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:02,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:52:02,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:52:02,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:02,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:02,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608263206] [2025-03-17 14:52:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608263206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:02,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:02,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601230746] [2025-03-17 14:52:02,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:02,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:02,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:02,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:02,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:02,463 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:02,488 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2025-03-17 14:52:02,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:02,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 18 [2025-03-17 14:52:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:02,490 INFO L225 Difference]: With dead ends: 50 [2025-03-17 14:52:02,490 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 14:52:02,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:02,491 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:02,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 14:52:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 14:52:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2025-03-17 14:52:02,496 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 18 [2025-03-17 14:52:02,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:02,497 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2025-03-17 14:52:02,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2025-03-17 14:52:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 14:52:02,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:02,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:02,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:52:02,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:02,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1881179670, now seen corresponding path program 1 times [2025-03-17 14:52:02,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:02,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683072039] [2025-03-17 14:52:02,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:02,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:02,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:52:02,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:52:02,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:02,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:02,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:02,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683072039] [2025-03-17 14:52:02,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683072039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:02,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:02,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:02,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996019114] [2025-03-17 14:52:02,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:02,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:02,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:02,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:02,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:02,536 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 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-17 14:52:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:02,556 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2025-03-17 14:52:02,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:02,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-17 14:52:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:02,557 INFO L225 Difference]: With dead ends: 49 [2025-03-17 14:52:02,557 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 14:52:02,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:02,557 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:02,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 24 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 14:52:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 14:52:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2025-03-17 14:52:02,564 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 19 [2025-03-17 14:52:02,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:02,564 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2025-03-17 14:52:02,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 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-17 14:52:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2025-03-17 14:52:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:52:02,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:02,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:02,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:52:02,565 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:02,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:02,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1812972403, now seen corresponding path program 1 times [2025-03-17 14:52:02,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:02,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466397538] [2025-03-17 14:52:02,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:02,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:02,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:52:02,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:52:02,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:02,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:02,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:02,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466397538] [2025-03-17 14:52:02,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466397538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:52:02,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:52:02,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:52:02,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161581740] [2025-03-17 14:52:02,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:52:02,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:52:02,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:02,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:52:02,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:02,601 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 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-17 14:52:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:02,619 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2025-03-17 14:52:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:52:02,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 14:52:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:02,621 INFO L225 Difference]: With dead ends: 51 [2025-03-17 14:52:02,621 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 14:52:02,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:52:02,622 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:02,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 14:52:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 14:52:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2025-03-17 14:52:02,626 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 20 [2025-03-17 14:52:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:02,626 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2025-03-17 14:52:02,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 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-17 14:52:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2025-03-17 14:52:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:52:02,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:02,630 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:02,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:52:02,630 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:02,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:02,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1490243115, now seen corresponding path program 1 times [2025-03-17 14:52:02,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:02,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196082824] [2025-03-17 14:52:02,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:02,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:02,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:52:02,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:52:02,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:02,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:02,679 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-17 14:52:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196082824] [2025-03-17 14:52:02,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196082824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663741393] [2025-03-17 14:52:02,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:02,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:02,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:02,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:02,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:52:02,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:52:02,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:52:02,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:02,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:02,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:52:02,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:02,755 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-17 14:52:02,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:02,803 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-17 14:52:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663741393] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:02,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:02,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:52:02,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122761890] [2025-03-17 14:52:02,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:02,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:52:02,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:02,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:52:02,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:52:02,804 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:02,874 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2025-03-17 14:52:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:52:02,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 22 [2025-03-17 14:52:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:02,875 INFO L225 Difference]: With dead ends: 78 [2025-03-17 14:52:02,875 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:52:02,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:52:02,876 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:02,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 40 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:52:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 47. [2025-03-17 14:52:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.205128205128205) internal successors, (47), 46 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2025-03-17 14:52:02,885 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 22 [2025-03-17 14:52:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:02,885 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2025-03-17 14:52:02,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2025-03-17 14:52:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 14:52:02,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:02,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:02,891 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-17 14:52:03,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 14:52:03,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:03,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:03,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1899524041, now seen corresponding path program 1 times [2025-03-17 14:52:03,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:03,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77439315] [2025-03-17 14:52:03,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:03,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:03,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:52:03,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:52:03,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:03,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:52:03,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [892771214] [2025-03-17 14:52:03,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:03,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:03,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:03,105 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:03,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:52:03,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:52:03,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:52:03,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:03,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:03,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:52:03,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:03,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:03,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:03,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77439315] [2025-03-17 14:52:03,239 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:52:03,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892771214] [2025-03-17 14:52:03,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892771214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:03,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:52:03,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2025-03-17 14:52:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26952682] [2025-03-17 14:52:03,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:03,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:52:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:03,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:52:03,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:52:03,241 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:03,321 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2025-03-17 14:52:03,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:52:03,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 24 [2025-03-17 14:52:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:03,322 INFO L225 Difference]: With dead ends: 100 [2025-03-17 14:52:03,322 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 14:52:03,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:52:03,323 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 57 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:03,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 57 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 14:52:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2025-03-17 14:52:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2025-03-17 14:52:03,327 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 24 [2025-03-17 14:52:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:03,327 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2025-03-17 14:52:03,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2025-03-17 14:52:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 14:52:03,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:03,328 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:03,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:03,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:03,529 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:03,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash 562366431, now seen corresponding path program 1 times [2025-03-17 14:52:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:03,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222703945] [2025-03-17 14:52:03,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:03,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:52:03,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:52:03,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:03,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:03,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:03,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222703945] [2025-03-17 14:52:03,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222703945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:03,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252127859] [2025-03-17 14:52:03,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:03,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:03,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:03,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:03,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:52:03,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:52:03,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:52:03,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:03,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:03,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:52:03,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:03,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:03,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252127859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:03,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:03,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:52:03,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496046567] [2025-03-17 14:52:03,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:03,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:52:03,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:03,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:52:03,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:52:03,891 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 11 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:03,942 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2025-03-17 14:52:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:52:03,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 14:52:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:03,943 INFO L225 Difference]: With dead ends: 87 [2025-03-17 14:52:03,943 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 14:52:03,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:52:03,944 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:03,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 63 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:03,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 14:52:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 14:52:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 81 states have (on average 1.123456790123457) internal successors, (91), 84 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2025-03-17 14:52:03,952 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 34 [2025-03-17 14:52:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:03,952 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2025-03-17 14:52:03,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2025-03-17 14:52:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 14:52:03,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:03,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:52:03,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:04,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:04,157 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:04,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:04,158 INFO L85 PathProgramCache]: Analyzing trace with hash 253490156, now seen corresponding path program 1 times [2025-03-17 14:52:04,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:04,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883394960] [2025-03-17 14:52:04,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:04,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:04,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 14:52:04,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 14:52:04,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:04,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:04,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:04,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883394960] [2025-03-17 14:52:04,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883394960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:04,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304984889] [2025-03-17 14:52:04,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:04,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:04,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:04,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:04,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:52:04,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 14:52:04,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 14:52:04,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:04,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:04,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:52:04,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:04,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:04,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304984889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:04,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:04,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:52:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642318541] [2025-03-17 14:52:04,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:04,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:52:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:04,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:52:04,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:52:04,487 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 11 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:04,544 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2025-03-17 14:52:04,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:52:04,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-17 14:52:04,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:04,544 INFO L225 Difference]: With dead ends: 86 [2025-03-17 14:52:04,544 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 14:52:04,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:52:04,546 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:04,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 87 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 14:52:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 14:52:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2025-03-17 14:52:04,554 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 35 [2025-03-17 14:52:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:04,554 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2025-03-17 14:52:04,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2025-03-17 14:52:04,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 14:52:04,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:04,554 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:52:04,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:04,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 14:52:04,755 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:04,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:04,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1209096694, now seen corresponding path program 1 times [2025-03-17 14:52:04,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:04,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387779712] [2025-03-17 14:52:04,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:04,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:04,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 14:52:04,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:52:04,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:04,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:04,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:04,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387779712] [2025-03-17 14:52:04,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387779712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:04,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759294145] [2025-03-17 14:52:04,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:04,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:04,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:04,806 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:04,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:52:04,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 14:52:04,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:52:04,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:04,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:04,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:52:04,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:04,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:05,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759294145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:05,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:05,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:52:05,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845197765] [2025-03-17 14:52:05,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:05,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:52:05,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:05,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:52:05,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:52:05,005 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 11 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:05,066 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2025-03-17 14:52:05,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:52:05,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-17 14:52:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:05,068 INFO L225 Difference]: With dead ends: 86 [2025-03-17 14:52:05,068 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 14:52:05,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:52:05,068 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:05,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 14:52:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 14:52:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2025-03-17 14:52:05,075 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 37 [2025-03-17 14:52:05,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:05,075 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2025-03-17 14:52:05,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2025-03-17 14:52:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 14:52:05,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:05,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 14:52:05,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:52:05,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:05,276 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:05,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:05,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1994213416, now seen corresponding path program 1 times [2025-03-17 14:52:05,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:05,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959052727] [2025-03-17 14:52:05,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:05,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:05,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 14:52:05,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:52:05,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:05,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:05,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:05,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959052727] [2025-03-17 14:52:05,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959052727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:05,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487416740] [2025-03-17 14:52:05,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:52:05,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:05,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:05,323 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:05,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:52:05,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 14:52:05,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:52:05,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:52:05,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:05,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:52:05,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:05,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:05,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487416740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:05,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:05,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:52:05,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105147491] [2025-03-17 14:52:05,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:05,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:52:05,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:05,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:52:05,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:52:05,428 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:05,451 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2025-03-17 14:52:05,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:52:05,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-17 14:52:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:05,452 INFO L225 Difference]: With dead ends: 103 [2025-03-17 14:52:05,453 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 14:52:05,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:52:05,453 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:05,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:52:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 14:52:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-03-17 14:52:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.0729166666666667) internal successors, (103), 99 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2025-03-17 14:52:05,457 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 39 [2025-03-17 14:52:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:05,457 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2025-03-17 14:52:05,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2025-03-17 14:52:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 14:52:05,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:05,458 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1] [2025-03-17 14:52:05,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:05,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:05,659 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:05,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:05,659 INFO L85 PathProgramCache]: Analyzing trace with hash 745070321, now seen corresponding path program 2 times [2025-03-17 14:52:05,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:05,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824853267] [2025-03-17 14:52:05,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:05,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:05,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-17 14:52:05,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 14:52:05,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:05,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:05,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:05,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824853267] [2025-03-17 14:52:05,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824853267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:05,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511448446] [2025-03-17 14:52:05,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:05,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:05,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:05,786 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:05,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:52:05,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-17 14:52:05,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 14:52:05,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:05,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:05,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:52:05,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:06,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:06,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511448446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:06,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:06,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-17 14:52:06,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710938812] [2025-03-17 14:52:06,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:06,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 14:52:06,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:06,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 14:52:06,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:52:06,177 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand has 20 states, 19 states have (on average 8.526315789473685) internal successors, (162), 19 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:06,330 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2025-03-17 14:52:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:52:06,331 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 8.526315789473685) internal successors, (162), 19 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-17 14:52:06,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:06,331 INFO L225 Difference]: With dead ends: 101 [2025-03-17 14:52:06,331 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 14:52:06,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2025-03-17 14:52:06,332 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:06,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 214 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 14:52:06,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-17 14:52:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2025-03-17 14:52:06,338 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 54 [2025-03-17 14:52:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:06,338 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2025-03-17 14:52:06,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 8.526315789473685) internal successors, (162), 19 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2025-03-17 14:52:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 14:52:06,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:06,340 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2025-03-17 14:52:06,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:06,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 14:52:06,541 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:06,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:06,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2100462102, now seen corresponding path program 2 times [2025-03-17 14:52:06,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:06,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10454237] [2025-03-17 14:52:06,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:06,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:06,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-17 14:52:06,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 14:52:06,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:06,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:06,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:06,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10454237] [2025-03-17 14:52:06,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10454237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:06,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54854492] [2025-03-17 14:52:06,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:06,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:06,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:06,663 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:06,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:52:06,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-17 14:52:06,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 14:52:06,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:06,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:06,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:52:06,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:06,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:07,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54854492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:07,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:07,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-17 14:52:07,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041828292] [2025-03-17 14:52:07,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:07,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 14:52:07,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:07,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 14:52:07,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2025-03-17 14:52:07,082 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 23 states, 22 states have (on average 10.227272727272727) internal successors, (225), 22 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-17 14:52:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:07,283 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2025-03-17 14:52:07,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:52:07,284 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 10.227272727272727) internal successors, (225), 22 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) Word has length 75 [2025-03-17 14:52:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:07,285 INFO L225 Difference]: With dead ends: 159 [2025-03-17 14:52:07,285 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 14:52:07,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=625, Unknown=0, NotChecked=0, Total=930 [2025-03-17 14:52:07,286 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 92 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:07,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 206 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 14:52:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2025-03-17 14:52:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 151 states have (on average 1.0794701986754967) internal successors, (163), 154 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2025-03-17 14:52:07,292 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 75 [2025-03-17 14:52:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:07,293 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2025-03-17 14:52:07,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 10.227272727272727) internal successors, (225), 22 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-17 14:52:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2025-03-17 14:52:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 14:52:07,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:07,295 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-03-17 14:52:07,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:52:07,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:52:07,496 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:07,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:07,496 INFO L85 PathProgramCache]: Analyzing trace with hash 180725188, now seen corresponding path program 2 times [2025-03-17 14:52:07,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:07,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782808134] [2025-03-17 14:52:07,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:07,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:07,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-17 14:52:07,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 14:52:07,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:07,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:52:07,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889234015] [2025-03-17 14:52:07,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:07,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:07,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:07,513 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:07,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:52:07,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-17 14:52:07,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 14:52:07,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:07,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:07,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:52:07,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:07,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:07,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:07,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782808134] [2025-03-17 14:52:07,781 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:52:07,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889234015] [2025-03-17 14:52:07,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889234015] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:07,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:52:07,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2025-03-17 14:52:07,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656639299] [2025-03-17 14:52:07,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:07,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:52:07,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:07,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:52:07,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:52:07,783 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand has 12 states, 11 states have (on average 14.727272727272727) internal successors, (162), 11 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:08,030 INFO L93 Difference]: Finished difference Result 212 states and 217 transitions. [2025-03-17 14:52:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:52:08,030 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 14.727272727272727) internal successors, (162), 11 states have internal predecessors, (162), 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 81 [2025-03-17 14:52:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:08,031 INFO L225 Difference]: With dead ends: 212 [2025-03-17 14:52:08,031 INFO L226 Difference]: Without dead ends: 211 [2025-03-17 14:52:08,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:52:08,032 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 93 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:08,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 183 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:52:08,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-17 14:52:08,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 199. [2025-03-17 14:52:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 195 states have (on average 1.082051282051282) internal successors, (211), 198 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 211 transitions. [2025-03-17 14:52:08,039 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 211 transitions. Word has length 81 [2025-03-17 14:52:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:08,039 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 211 transitions. [2025-03-17 14:52:08,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 14.727272727272727) internal successors, (162), 11 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 211 transitions. [2025-03-17 14:52:08,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 14:52:08,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:08,041 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1] [2025-03-17 14:52:08,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 14:52:08,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:52:08,241 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:08,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1037615889, now seen corresponding path program 3 times [2025-03-17 14:52:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:08,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132568541] [2025-03-17 14:52:08,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:52:08,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:08,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 5 equivalence classes. [2025-03-17 14:52:08,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 14:52:08,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 14:52:08,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132568541] [2025-03-17 14:52:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132568541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427430594] [2025-03-17 14:52:08,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:52:08,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:08,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:08,462 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:08,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:52:08,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 5 equivalence classes. [2025-03-17 14:52:08,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 14:52:08,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 14:52:08,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:08,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:52:08,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:08,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:09,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427430594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:09,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:09,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2025-03-17 14:52:09,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573036389] [2025-03-17 14:52:09,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:09,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 14:52:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:09,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 14:52:09,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 14:52:09,287 INFO L87 Difference]: Start difference. First operand 199 states and 211 transitions. Second operand has 38 states, 37 states have (on average 7.45945945945946) internal successors, (276), 37 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:09,808 INFO L93 Difference]: Finished difference Result 201 states and 211 transitions. [2025-03-17 14:52:09,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 14:52:09,809 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 7.45945945945946) internal successors, (276), 37 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-17 14:52:09,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:09,809 INFO L225 Difference]: With dead ends: 201 [2025-03-17 14:52:09,809 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 14:52:09,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=952, Invalid=2240, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 14:52:09,811 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 211 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:09,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 360 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:52:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 14:52:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2025-03-17 14:52:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 195 states have (on average 1.0615384615384615) internal successors, (207), 198 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 207 transitions. [2025-03-17 14:52:09,817 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 207 transitions. Word has length 92 [2025-03-17 14:52:09,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:09,817 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 207 transitions. [2025-03-17 14:52:09,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 7.45945945945946) internal successors, (276), 37 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 207 transitions. [2025-03-17 14:52:09,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 14:52:09,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:09,820 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1] [2025-03-17 14:52:09,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 14:52:10,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:10,021 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:10,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:10,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1319369933, now seen corresponding path program 2 times [2025-03-17 14:52:10,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:10,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501663622] [2025-03-17 14:52:10,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:10,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-17 14:52:10,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 14:52:10,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:10,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:10,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:10,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501663622] [2025-03-17 14:52:10,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501663622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:10,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923197677] [2025-03-17 14:52:10,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:52:10,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:10,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:10,159 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:10,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:52:10,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-17 14:52:10,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 14:52:10,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:52:10,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:10,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:52:10,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 108 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:10,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:10,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923197677] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:10,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:10,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-17 14:52:10,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384102567] [2025-03-17 14:52:10,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:10,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 14:52:10,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:10,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 14:52:10,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2025-03-17 14:52:10,678 INFO L87 Difference]: Start difference. First operand 199 states and 207 transitions. Second operand has 27 states, 26 states have (on average 10.26923076923077) internal successors, (267), 26 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:52:10,857 INFO L93 Difference]: Finished difference Result 199 states and 207 transitions. [2025-03-17 14:52:10,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:52:10,858 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 10.26923076923077) internal successors, (267), 26 states have internal predecessors, (267), 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 96 [2025-03-17 14:52:10,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:52:10,858 INFO L225 Difference]: With dead ends: 199 [2025-03-17 14:52:10,858 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 14:52:10,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=376, Invalid=884, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 14:52:10,859 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 97 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:52:10,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 364 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:52:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 14:52:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-03-17 14:52:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 195 states have (on average 1.0307692307692307) internal successors, (201), 197 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 201 transitions. [2025-03-17 14:52:10,865 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 201 transitions. Word has length 96 [2025-03-17 14:52:10,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:52:10,865 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 201 transitions. [2025-03-17 14:52:10,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 10.26923076923077) internal successors, (267), 26 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 201 transitions. [2025-03-17 14:52:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 14:52:10,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:52:10,866 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1] [2025-03-17 14:52:10,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 14:52:11,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:11,067 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:52:11,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:52:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2039056982, now seen corresponding path program 3 times [2025-03-17 14:52:11,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:52:11,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734082819] [2025-03-17 14:52:11,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:52:11,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:52:11,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 8 equivalence classes. [2025-03-17 14:52:11,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 14:52:11,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 14:52:11,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 0 proven. 518 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:52:11,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:52:11,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734082819] [2025-03-17 14:52:11,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734082819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:52:11,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219427417] [2025-03-17 14:52:11,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:52:11,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:52:11,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:52:11,521 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:52:11,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:52:11,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 8 equivalence classes. [2025-03-17 14:52:11,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 75 of 151 statements. [2025-03-17 14:52:11,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 14:52:11,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:52:11,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:52:11,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:52:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 317 proven. 31 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-17 14:52:25,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:52:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 282 proven. 66 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-17 14:52:26,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219427417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:52:26,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:52:26,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 13] total 47 [2025-03-17 14:52:26,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624363190] [2025-03-17 14:52:26,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:52:26,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 14:52:26,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:52:26,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 14:52:26,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2039, Unknown=3, NotChecked=0, Total=2256 [2025-03-17 14:52:26,417 INFO L87 Difference]: Start difference. First operand 198 states and 201 transitions. Second operand has 48 states, 47 states have (on average 6.23404255319149) internal successors, (293), 48 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:52:31,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:52:36,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:52:38,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:52:43,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:52:48,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:52:56,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:06,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:14,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:16,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:22,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:26,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:31,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:35,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:53:44,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]