./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/loop-zilu/benchmark22_conjunctive.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/loop-zilu/benchmark22_conjunctive.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 332149e5bab02f901d22a394d7fc8b75a68c916816faa3fd6dccce4a7c616f3c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:02:56,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:02:56,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:02:56,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:02:56,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:02:56,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:02:56,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:02:56,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:02:56,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:02:56,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:02:56,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:02:56,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:02:56,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:02:56,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:02:56,671 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:02:56,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:02:56,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:02:56,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:02:56,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:02:56,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:02:56,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:02:56,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:02:56,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:02:56,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:02:56,672 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:02:56,672 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:02:56,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:02:56,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:02:56,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:02:56,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:02:56,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:56,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:56,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:02:56,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:02:56,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:02:56,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:02:56,674 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 -> 332149e5bab02f901d22a394d7fc8b75a68c916816faa3fd6dccce4a7c616f3c [2025-04-29 11:02:56,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:02:56,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:02:56,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:02:56,924 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:02:56,924 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:02:56,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark22_conjunctive.c [2025-04-29 11:02:58,259 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a93099c/c5ee6c9c6b674bd8a0f9a8e4442eecd4/FLAG267349a48 [2025-04-29 11:02:58,459 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:02:58,460 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark22_conjunctive.c [2025-04-29 11:02:58,461 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:02:58,465 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a93099c/c5ee6c9c6b674bd8a0f9a8e4442eecd4/FLAG267349a48 [2025-04-29 11:02:59,308 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a93099c/c5ee6c9c6b674bd8a0f9a8e4442eecd4 [2025-04-29 11:02:59,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:02:59,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:02:59,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:59,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:02:59,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:02:59,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5366a86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59, skipping insertion in model container [2025-04-29 11:02:59,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:02:59,482 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:59,486 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:02:59,511 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:59,520 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:02:59,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59 WrapperNode [2025-04-29 11:02:59,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:59,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:59,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:02:59,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:02:59,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,550 INFO L138 Inliner]: procedures = 7, calls = 4, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 35 [2025-04-29 11:02:59,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:59,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:02:59,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:02:59,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:02:59,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,564 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 11:02:59,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:02:59,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:02:59,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:02:59,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:02:59,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (1/1) ... [2025-04-29 11:02:59,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:59,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:59,609 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-04-29 11:02:59,618 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-04-29 11:02:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:02:59,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:02:59,673 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:02:59,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:02:59,765 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-04-29 11:02:59,765 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:02:59,771 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:02:59,771 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:02:59,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:59 BoogieIcfgContainer [2025-04-29 11:02:59,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:02:59,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:02:59,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:02:59,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:02:59,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:02:59" (1/3) ... [2025-04-29 11:02:59,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0bc1ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:59, skipping insertion in model container [2025-04-29 11:02:59,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:59" (2/3) ... [2025-04-29 11:02:59,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0bc1ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:59, skipping insertion in model container [2025-04-29 11:02:59,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:59" (3/3) ... [2025-04-29 11:02:59,779 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark22_conjunctive.c [2025-04-29 11:02:59,790 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:02:59,791 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark22_conjunctive.c that has 1 procedures, 20 locations, 23 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-29 11:02:59,835 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:02:59,843 INFO L340 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;@72808192, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:02:59,844 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-29 11:02:59,847 INFO L278 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 19 states have internal predecessors, (23), 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-04-29 11:02:59,850 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:02:59,850 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:59,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:02:59,851 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:02:59,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash 889570283, now seen corresponding path program 1 times [2025-04-29 11:02:59,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:59,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396707245] [2025-04-29 11:02:59,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:59,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:59,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:02:59,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:02:59,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:59,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:59,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:59,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396707245] [2025-04-29 11:02:59,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396707245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:59,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:59,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:02:59,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279742900] [2025-04-29 11:02:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:59,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:00,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:03:00,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:03:00,003 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 19 states have internal predecessors, (23), 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 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-04-29 11:03:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:00,042 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-04-29 11:03:00,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:03:00,044 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-04-29 11:03:00,044 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:00,048 INFO L225 Difference]: With dead ends: 32 [2025-04-29 11:03:00,048 INFO L226 Difference]: Without dead ends: 17 [2025-04-29 11:03:00,049 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:03:00,051 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 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-04-29 11:03:00,052 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-04-29 11:03:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-04-29 11:03:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 15 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-04-29 11:03:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-04-29 11:03:00,075 INFO L79 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 6 [2025-04-29 11:03:00,075 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:00,075 INFO L485 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-04-29 11:03:00,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-04-29 11:03:00,075 INFO L278 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-04-29 11:03:00,076 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:03:00,076 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:00,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:03:00,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:03:00,077 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:00,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:00,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1806875048, now seen corresponding path program 1 times [2025-04-29 11:03:00,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:00,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564738643] [2025-04-29 11:03:00,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:00,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:00,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:03:00,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:03:00,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:00,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:00,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:00,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564738643] [2025-04-29 11:03:00,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564738643] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:03:00,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:03:00,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:03:00,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140483352] [2025-04-29 11:03:00,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:03:00,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:03:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:00,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:03:00,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:03:00,138 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:00,161 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-04-29 11:03:00,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:03:00,161 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:03:00,162 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:00,162 INFO L225 Difference]: With dead ends: 18 [2025-04-29 11:03:00,162 INFO L226 Difference]: Without dead ends: 17 [2025-04-29 11:03:00,162 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:03:00,163 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:00,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:00,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-04-29 11:03:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-04-29 11:03:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 16 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-04-29 11:03:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-04-29 11:03:00,168 INFO L79 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2025-04-29 11:03:00,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:00,169 INFO L485 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-04-29 11:03:00,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:00,169 INFO L278 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-04-29 11:03:00,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:03:00,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:00,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:03:00,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:03:00,169 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:00,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 178551693, now seen corresponding path program 1 times [2025-04-29 11:03:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:00,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136655184] [2025-04-29 11:03:00,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:00,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:00,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:03:00,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:03:00,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:00,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:00,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:00,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136655184] [2025-04-29 11:03:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136655184] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:03:00,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:03:00,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:03:00,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971964760] [2025-04-29 11:03:00,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:03:00,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:03:00,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:00,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:03:00,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:03:00,233 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04-29 11:03:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:00,256 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2025-04-29 11:03:00,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:03:00,256 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-04-29 11:03:00,259 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:00,259 INFO L225 Difference]: With dead ends: 17 [2025-04-29 11:03:00,259 INFO L226 Difference]: Without dead ends: 16 [2025-04-29 11:03:00,259 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:03:00,260 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:00,260 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-04-29 11:03:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-04-29 11:03:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 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-04-29 11:03:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-04-29 11:03:00,262 INFO L79 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2025-04-29 11:03:00,262 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:00,263 INFO L485 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-04-29 11:03:00,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04-29 11:03:00,264 INFO L278 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-04-29 11:03:00,264 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:03:00,264 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:00,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:03:00,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:03:00,264 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:00,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:00,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1240135242, now seen corresponding path program 1 times [2025-04-29 11:03:00,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:00,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301288368] [2025-04-29 11:03:00,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:00,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:00,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:03:00,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:03:00,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:00,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:00,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:00,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301288368] [2025-04-29 11:03:00,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301288368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:03:00,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:03:00,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:03:00,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166374959] [2025-04-29 11:03:00,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:03:00,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:03:00,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:00,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:03:00,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:03:00,320 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-04-29 11:03:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:00,345 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-04-29 11:03:00,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:03:00,346 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-04-29 11:03:00,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:00,346 INFO L225 Difference]: With dead ends: 19 [2025-04-29 11:03:00,346 INFO L226 Difference]: Without dead ends: 18 [2025-04-29 11:03:00,347 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:03:00,347 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:00,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-04-29 11:03:00,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-04-29 11:03:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 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-04-29 11:03:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-04-29 11:03:00,350 INFO L79 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 9 [2025-04-29 11:03:00,350 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:00,351 INFO L485 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-04-29 11:03:00,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-04-29 11:03:00,351 INFO L278 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-04-29 11:03:00,351 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:03:00,351 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:00,351 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:03:00,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:03:00,351 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:00,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:00,352 INFO L85 PathProgramCache]: Analyzing trace with hash -439644956, now seen corresponding path program 1 times [2025-04-29 11:03:00,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:00,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072158699] [2025-04-29 11:03:00,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:00,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:00,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:03:00,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:03:00,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:00,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:00,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:00,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072158699] [2025-04-29 11:03:00,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072158699] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:00,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166919225] [2025-04-29 11:03:00,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:00,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:00,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:00,437 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-04-29 11:03:00,439 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-04-29 11:03:00,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:03:00,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:03:00,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:00,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:00,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:03:00,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:00,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166919225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:00,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:00,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2025-04-29 11:03:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092220928] [2025-04-29 11:03:00,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:00,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:03:00,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:00,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:03:00,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:03:00,669 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 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-04-29 11:03:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:00,752 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-04-29 11:03:00,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:03:00,753 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 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) Word has length 12 [2025-04-29 11:03:00,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:00,753 INFO L225 Difference]: With dead ends: 30 [2025-04-29 11:03:00,753 INFO L226 Difference]: Without dead ends: 29 [2025-04-29 11:03:00,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:03:00,755 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:00,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 44 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:03:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-29 11:03:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-04-29 11:03:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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-04-29 11:03:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-04-29 11:03:00,762 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 12 [2025-04-29 11:03:00,763 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:00,763 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-04-29 11:03:00,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 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-04-29 11:03:00,763 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-04-29 11:03:00,763 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:03:00,763 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:00,763 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:03:00,770 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-04-29 11:03:00,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:00,968 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:00,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:00,969 INFO L85 PathProgramCache]: Analyzing trace with hash -744091697, now seen corresponding path program 1 times [2025-04-29 11:03:00,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:00,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729442292] [2025-04-29 11:03:00,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:00,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:03:00,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:03:00,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:00,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:01,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:01,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729442292] [2025-04-29 11:03:01,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729442292] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:01,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700908140] [2025-04-29 11:03:01,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:01,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:01,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:01,062 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-04-29 11:03:01,063 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-04-29 11:03:01,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:03:01,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:03:01,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:01,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:01,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:03:01,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:01,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:01,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700908140] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:01,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:01,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-04-29 11:03:01,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202600047] [2025-04-29 11:03:01,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:01,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:03:01,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:01,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:03:01,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:03:01,188 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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-04-29 11:03:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:01,228 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-04-29 11:03:01,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:03:01,228 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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 13 [2025-04-29 11:03:01,228 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:01,229 INFO L225 Difference]: With dead ends: 29 [2025-04-29 11:03:01,229 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 11:03:01,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:03:01,229 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:01,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 11:03:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-29 11:03:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 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-04-29 11:03:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-04-29 11:03:01,232 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 13 [2025-04-29 11:03:01,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:01,232 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-04-29 11:03:01,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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-04-29 11:03:01,233 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-04-29 11:03:01,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:03:01,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:01,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:03:01,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:03:01,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-29 11:03:01,434 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:01,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:01,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2107547983, now seen corresponding path program 1 times [2025-04-29 11:03:01,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:01,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762996072] [2025-04-29 11:03:01,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:01,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:01,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:03:01,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:03:01,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:01,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:01,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:01,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762996072] [2025-04-29 11:03:01,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762996072] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:01,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61307044] [2025-04-29 11:03:01,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:01,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:01,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:01,492 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-04-29 11:03:01,494 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-04-29 11:03:01,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:03:01,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:03:01,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:01,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:01,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:03:01,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:01,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:01,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61307044] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:01,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:01,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-29 11:03:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023274070] [2025-04-29 11:03:01,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:01,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:03:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:01,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:03:01,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:03:01,592 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-04-29 11:03:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:01,630 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-04-29 11:03:01,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:03:01,630 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-04-29 11:03:01,630 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:01,630 INFO L225 Difference]: With dead ends: 37 [2025-04-29 11:03:01,630 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 11:03:01,631 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:03:01,631 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:01,631 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 11:03:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-04-29 11:03:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-04-29 11:03:01,641 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 15 [2025-04-29 11:03:01,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:01,641 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-04-29 11:03:01,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-04-29 11:03:01,641 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-04-29 11:03:01,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:03:01,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:01,642 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2025-04-29 11:03:01,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:03:01,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:01,842 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:01,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:01,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1932127594, now seen corresponding path program 2 times [2025-04-29 11:03:01,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:01,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961928127] [2025-04-29 11:03:01,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:03:01,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:01,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:03:01,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:03:01,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:03:01,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:01,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:01,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961928127] [2025-04-29 11:03:01,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961928127] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:01,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099240740] [2025-04-29 11:03:01,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:03:01,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:01,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:01,987 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-04-29 11:03:01,988 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-04-29 11:03:02,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:03:02,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:03:02,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:03:02,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:02,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:03:02,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:02,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:03:02,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099240740] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:03:02,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:03:02,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-04-29 11:03:02,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85184809] [2025-04-29 11:03:02,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:03:02,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:03:02,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:02,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:03:02,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:03:02,172 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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-04-29 11:03:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:02,219 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-04-29 11:03:02,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:03:02,219 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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-04-29 11:03:02,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:02,220 INFO L225 Difference]: With dead ends: 36 [2025-04-29 11:03:02,220 INFO L226 Difference]: Without dead ends: 35 [2025-04-29 11:03:02,220 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:03:02,220 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:02,221 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-29 11:03:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-29 11:03:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 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-04-29 11:03:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-04-29 11:03:02,223 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 24 [2025-04-29 11:03:02,224 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:02,224 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-04-29 11:03:02,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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-04-29 11:03:02,224 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-04-29 11:03:02,224 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:03:02,224 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:02,224 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1] [2025-04-29 11:03:02,230 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-04-29 11:03:02,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:02,425 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:02,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:02,425 INFO L85 PathProgramCache]: Analyzing trace with hash 233586781, now seen corresponding path program 2 times [2025-04-29 11:03:02,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:02,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325590646] [2025-04-29 11:03:02,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:03:02,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:02,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-29 11:03:02,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:03:02,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:03:02,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:02,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:02,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325590646] [2025-04-29 11:03:02,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325590646] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:02,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667846249] [2025-04-29 11:03:02,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:03:02,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:02,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:02,542 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-04-29 11:03:02,543 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-04-29 11:03:02,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-29 11:03:02,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:03:02,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:03:02,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:02,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:03:02,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:02,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667846249] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:02,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-04-29 11:03:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225818694] [2025-04-29 11:03:02,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:02,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:03:02,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:02,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:03:02,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:03:02,854 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 23 states, 22 states have (on average 3.227272727272727) internal successors, (71), 23 states have internal predecessors, (71), 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-04-29 11:03:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:02,966 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-04-29 11:03:02,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:03:02,966 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.227272727272727) internal successors, (71), 23 states have internal predecessors, (71), 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 25 [2025-04-29 11:03:02,966 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:02,967 INFO L225 Difference]: With dead ends: 52 [2025-04-29 11:03:02,967 INFO L226 Difference]: Without dead ends: 51 [2025-04-29 11:03:02,967 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:03:02,968 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:02,968 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:03:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-29 11:03:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-04-29 11:03:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 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-04-29 11:03:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-04-29 11:03:02,971 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 25 [2025-04-29 11:03:02,971 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:02,971 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-04-29 11:03:02,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.227272727272727) internal successors, (71), 23 states have internal predecessors, (71), 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-04-29 11:03:02,972 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-04-29 11:03:02,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:03:02,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:02,972 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-04-29 11:03:02,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:03:03,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:03,176 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:03,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:03,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2112397210, now seen corresponding path program 2 times [2025-04-29 11:03:03,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:03,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630075682] [2025-04-29 11:03:03,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:03:03,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:03,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-29 11:03:03,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:03:03,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:03:03,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:03,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:03,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630075682] [2025-04-29 11:03:03,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630075682] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:03,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834389299] [2025-04-29 11:03:03,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:03:03,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:03,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:03,309 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-04-29 11:03:03,311 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-04-29 11:03:03,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-29 11:03:03,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:03:03,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:03:03,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:03,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:03:03,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:03,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:03,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834389299] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:03,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:03,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-04-29 11:03:03,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145065285] [2025-04-29 11:03:03,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:03,690 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-29 11:03:03,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:03,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-29 11:03:03,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:03:03,691 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 27 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 27 states have internal predecessors, (87), 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-04-29 11:03:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:03,897 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2025-04-29 11:03:03,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:03:03,898 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 27 states have internal predecessors, (87), 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 33 [2025-04-29 11:03:03,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:03,898 INFO L225 Difference]: With dead ends: 51 [2025-04-29 11:03:03,898 INFO L226 Difference]: Without dead ends: 50 [2025-04-29 11:03:03,899 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:03:03,899 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:03,900 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:03:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-29 11:03:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-04-29 11:03:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0204081632653061) 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-04-29 11:03:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2025-04-29 11:03:03,904 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 33 [2025-04-29 11:03:03,905 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:03,905 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2025-04-29 11:03:03,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 27 states have internal predecessors, (87), 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-04-29 11:03:03,905 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2025-04-29 11:03:03,905 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 11:03:03,905 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:03,906 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1] [2025-04-29 11:03:03,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:03:04,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:04,106 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:04,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1768361351, now seen corresponding path program 3 times [2025-04-29 11:03:04,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:04,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897372134] [2025-04-29 11:03:04,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:03:04,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:04,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 8 equivalence classes. [2025-04-29 11:03:04,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:03:04,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-04-29 11:03:04,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:04,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897372134] [2025-04-29 11:03:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897372134] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:04,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993257532] [2025-04-29 11:03:04,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:03:04,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:04,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:04,434 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-04-29 11:03:04,436 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-04-29 11:03:04,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 8 equivalence classes. [2025-04-29 11:03:04,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:03:04,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-04-29 11:03:04,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:04,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:03:04,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:04,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:05,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993257532] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:05,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:05,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2025-04-29 11:03:05,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762862098] [2025-04-29 11:03:05,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:05,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-29 11:03:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:05,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-29 11:03:05,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1830, Unknown=0, NotChecked=0, Total=2162 [2025-04-29 11:03:05,235 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 47 states, 46 states have (on average 3.108695652173913) internal successors, (143), 47 states have internal predecessors, (143), 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-04-29 11:03:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:05,678 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2025-04-29 11:03:05,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-29 11:03:05,679 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.108695652173913) internal successors, (143), 47 states have internal predecessors, (143), 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 49 [2025-04-29 11:03:05,679 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:05,679 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:03:05,679 INFO L226 Difference]: Without dead ends: 98 [2025-04-29 11:03:05,681 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=530, Invalid=2892, Unknown=0, NotChecked=0, Total=3422 [2025-04-29 11:03:05,683 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:05,684 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:03:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-29 11:03:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-04-29 11:03:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 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-04-29 11:03:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2025-04-29 11:03:05,691 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 49 [2025-04-29 11:03:05,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:05,691 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2025-04-29 11:03:05,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.108695652173913) internal successors, (143), 47 states have internal predecessors, (143), 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-04-29 11:03:05,691 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2025-04-29 11:03:05,693 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-04-29 11:03:05,693 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:05,693 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 1, 1, 1, 1] [2025-04-29 11:03:05,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:03:05,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:05,896 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:05,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:05,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2031773007, now seen corresponding path program 4 times [2025-04-29 11:03:05,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:05,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455858835] [2025-04-29 11:03:05,896 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:03:05,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:05,924 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 97 statements into 2 equivalence classes. [2025-04-29 11:03:05,938 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-04-29 11:03:05,938 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:03:05,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 690 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:06,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:06,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455858835] [2025-04-29 11:03:06,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455858835] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:06,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897077766] [2025-04-29 11:03:06,801 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:03:06,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:06,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:06,803 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-04-29 11:03:06,804 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-04-29 11:03:06,825 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 97 statements into 2 equivalence classes. [2025-04-29 11:03:06,843 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-04-29 11:03:06,843 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:03:06,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:06,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-29 11:03:06,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 690 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:07,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 690 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897077766] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:08,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:08,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 94 [2025-04-29 11:03:08,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800462397] [2025-04-29 11:03:08,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:08,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2025-04-29 11:03:08,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:08,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2025-04-29 11:03:08,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=7750, Unknown=0, NotChecked=0, Total=8930 [2025-04-29 11:03:08,813 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand has 95 states, 94 states have (on average 3.0531914893617023) internal successors, (287), 95 states have internal predecessors, (287), 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-04-29 11:03:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:10,422 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2025-04-29 11:03:10,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-29 11:03:10,422 INFO L79 Accepts]: Start accepts. Automaton has has 95 states, 94 states have (on average 3.0531914893617023) internal successors, (287), 95 states have internal predecessors, (287), 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 97 [2025-04-29 11:03:10,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:10,423 INFO L225 Difference]: With dead ends: 195 [2025-04-29 11:03:10,423 INFO L226 Difference]: Without dead ends: 194 [2025-04-29 11:03:10,426 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4052 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2090, Invalid=12916, Unknown=0, NotChecked=0, Total=15006 [2025-04-29 11:03:10,426 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:10,426 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:03:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-29 11:03:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-04-29 11:03:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.005181347150259) internal successors, (194), 193 states have internal predecessors, (194), 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-04-29 11:03:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2025-04-29 11:03:10,434 INFO L79 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 97 [2025-04-29 11:03:10,434 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:10,434 INFO L485 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2025-04-29 11:03:10,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 94 states have (on average 3.0531914893617023) internal successors, (287), 95 states have internal predecessors, (287), 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-04-29 11:03:10,435 INFO L278 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2025-04-29 11:03:10,436 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-04-29 11:03:10,436 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:10,436 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 1, 1, 1, 1] [2025-04-29 11:03:10,444 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-04-29 11:03:10,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-29 11:03:10,636 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:10,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:10,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1826356001, now seen corresponding path program 5 times [2025-04-29 11:03:10,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:10,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925103334] [2025-04-29 11:03:10,637 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:03:10,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:10,644 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 193 statements into 32 equivalence classes. [2025-04-29 11:03:10,717 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 193 of 193 statements. [2025-04-29 11:03:10,718 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-04-29 11:03:10,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:13,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 2914 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:13,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:13,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925103334] [2025-04-29 11:03:13,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925103334] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:13,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136271965] [2025-04-29 11:03:13,504 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:03:13,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:13,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:13,506 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-04-29 11:03:13,507 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-04-29 11:03:13,541 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 193 statements into 32 equivalence classes. [2025-04-29 11:03:13,621 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 193 of 193 statements. [2025-04-29 11:03:13,621 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-04-29 11:03:13,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:13,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-04-29 11:03:13,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 2914 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:16,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 2914 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:20,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136271965] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:20,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:20,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 190 [2025-04-29 11:03:20,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16802623] [2025-04-29 11:03:20,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:20,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 191 states [2025-04-29 11:03:20,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:20,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2025-04-29 11:03:20,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4412, Invalid=31878, Unknown=0, NotChecked=0, Total=36290 [2025-04-29 11:03:20,777 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand has 191 states, 190 states have (on average 3.026315789473684) internal successors, (575), 191 states have internal predecessors, (575), 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-04-29 11:03:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:29,057 INFO L93 Difference]: Finished difference Result 387 states and 418 transitions. [2025-04-29 11:03:29,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2025-04-29 11:03:29,057 INFO L79 Accepts]: Start accepts. Automaton has has 191 states, 190 states have (on average 3.026315789473684) internal successors, (575), 191 states have internal predecessors, (575), 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 193 [2025-04-29 11:03:29,058 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:29,059 INFO L225 Difference]: With dead ends: 387 [2025-04-29 11:03:29,059 INFO L226 Difference]: Without dead ends: 386 [2025-04-29 11:03:29,062 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17300 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=8282, Invalid=54468, Unknown=0, NotChecked=0, Total=62750 [2025-04-29 11:03:29,062 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:29,063 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:03:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-04-29 11:03:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-04-29 11:03:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.0025974025974025) internal successors, (386), 385 states have internal predecessors, (386), 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-04-29 11:03:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2025-04-29 11:03:29,096 INFO L79 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 193 [2025-04-29 11:03:29,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:29,097 INFO L485 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2025-04-29 11:03:29,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 191 states, 190 states have (on average 3.026315789473684) internal successors, (575), 191 states have internal predecessors, (575), 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-04-29 11:03:29,097 INFO L278 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2025-04-29 11:03:29,103 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-04-29 11:03:29,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:29,104 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 63, 63, 63, 1, 1, 1, 1] [2025-04-29 11:03:29,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 11:03:29,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-29 11:03:29,305 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:29,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash -88278015, now seen corresponding path program 6 times [2025-04-29 11:03:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:29,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122985831] [2025-04-29 11:03:29,306 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:03:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:29,317 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 385 statements into 64 equivalence classes. [2025-04-29 11:03:29,473 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) and asserted 385 of 385 statements. [2025-04-29 11:03:29,474 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2025-04-29 11:03:29,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 11970 backedges. 0 proven. 11970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:38,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:38,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122985831] [2025-04-29 11:03:38,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122985831] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:38,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873957633] [2025-04-29 11:03:38,762 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:03:38,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:38,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:38,764 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-04-29 11:03:38,765 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-04-29 11:03:38,806 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 385 statements into 64 equivalence classes. [2025-04-29 11:03:39,110 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) and asserted 385 of 385 statements. [2025-04-29 11:03:39,110 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2025-04-29 11:03:39,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:39,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-04-29 11:03:39,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 11970 backedges. 0 proven. 11970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:51,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:04:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11970 backedges. 0 proven. 11970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:05,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873957633] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:04:05,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:04:05,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128, 128] total 382 [2025-04-29 11:04:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785179258] [2025-04-29 11:04:05,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:04:05,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 383 states [2025-04-29 11:04:05,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:05,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 383 interpolants. [2025-04-29 11:04:05,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=129286, Unknown=0, NotChecked=0, Total=146306 [2025-04-29 11:04:05,488 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand has 383 states, 382 states have (on average 3.013089005235602) internal successors, (1151), 383 states have internal predecessors, (1151), 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) Killed by 15