./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.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 aad83614f5b3454ec30b386336992d9fee88422d967149e7e88efe6256830f00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:14:30,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:14:30,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:14:30,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:14:30,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:14:30,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:14:30,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:14:30,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:14:30,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:14:30,981 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:14:30,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:14:30,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:14:30,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:14:30,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:14:30,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:14:30,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:14:30,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:14:30,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:14:30,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:14:30,984 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 -> aad83614f5b3454ec30b386336992d9fee88422d967149e7e88efe6256830f00 [2025-03-04 11:14:31,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:14:31,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:14:31,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:14:31,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:14:31,209 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:14:31,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c [2025-03-04 11:14:32,309 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3ce8758/27c5ab27cd834af5bc394f8e490312dc/FLAGad7b9b7b3 [2025-03-04 11:14:32,559 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:14:32,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c [2025-03-04 11:14:32,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3ce8758/27c5ab27cd834af5bc394f8e490312dc/FLAGad7b9b7b3 [2025-03-04 11:14:32,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3ce8758/27c5ab27cd834af5bc394f8e490312dc [2025-03-04 11:14:32,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:14:32,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:14:32,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:14:32,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:14:32,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:14:32,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:14:32" (1/1) ... [2025-03-04 11:14:32,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596ada1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:32, skipping insertion in model container [2025-03-04 11:14:32,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:14:32" (1/1) ... [2025-03-04 11:14:32,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:14:33,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:14:33,018 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:14:33,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:14:33,037 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:14:33,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33 WrapperNode [2025-03-04 11:14:33,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:14:33,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:14:33,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:14:33,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:14:33,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (1/1) ... [2025-03-04 11:14:33,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (1/1) ... [2025-03-04 11:14:33,057 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2025-03-04 11:14:33,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:14:33,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:14:33,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:14:33,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:14:33,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (1/1) ... [2025-03-04 11:14:33,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (1/1) ... [2025-03-04 11:14:33,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (1/1) ... [2025-03-04 11:14:33,071 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:14:33,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (1/1) ... [2025-03-04 11:14:33,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (1/1) ... [2025-03-04 11:14:33,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (1/1) ... [2025-03-04 11:14:33,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (1/1) ... [2025-03-04 11:14:33,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (1/1) ... [2025-03-04 11:14:33,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (1/1) ... [2025-03-04 11:14:33,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:14:33,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:14:33,076 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:14:33,076 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:14:33,077 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (1/1) ... [2025-03-04 11:14:33,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:14:33,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:33,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:14:33,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:14:33,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:14:33,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:14:33,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:14:33,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:14:33,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:14:33,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:14:33,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:14:33,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:14:33,158 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:14:33,160 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:14:33,338 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-04 11:14:33,338 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:14:33,350 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:14:33,350 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:14:33,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:14:33 BoogieIcfgContainer [2025-03-04 11:14:33,350 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:14:33,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:14:33,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:14:33,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:14:33,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:14:32" (1/3) ... [2025-03-04 11:14:33,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de8f622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:14:33, skipping insertion in model container [2025-03-04 11:14:33,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:14:33" (2/3) ... [2025-03-04 11:14:33,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de8f622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:14:33, skipping insertion in model container [2025-03-04 11:14:33,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:14:33" (3/3) ... [2025-03-04 11:14:33,359 INFO L128 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound5.c [2025-03-04 11:14:33,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:14:33,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mannadiv_unwindbound5.c that has 3 procedures, 69 locations, 1 initial locations, 1 loop locations, and 22 error locations. [2025-03-04 11:14:33,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:14:33,426 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70de7cf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:14:33,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 11:14:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 40 states have (on average 1.7) internal successors, (68), 62 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:14:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:14:33,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:33,432 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:33,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:33,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:33,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1896484220, now seen corresponding path program 1 times [2025-03-04 11:14:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197593788] [2025-03-04 11:14:33,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:33,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:33,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:14:33,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:14:33,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:33,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:33,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:33,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197593788] [2025-03-04 11:14:33,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197593788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:33,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:33,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:14:33,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687881098] [2025-03-04 11:14:33,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:33,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:14:33,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:33,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:14:33,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:33,614 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.7) internal successors, (68), 62 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:14:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:33,675 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2025-03-04 11:14:33,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:14:33,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-03-04 11:14:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:33,681 INFO L225 Difference]: With dead ends: 138 [2025-03-04 11:14:33,681 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 11:14:33,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:14:33,684 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:33,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 190 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 11:14:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 11:14:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:14:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-03-04 11:14:33,714 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 15 [2025-03-04 11:14:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:33,714 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-03-04 11:14:33,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:14:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-03-04 11:14:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 11:14:33,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:33,715 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:33,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:14:33,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:33,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:33,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2133360073, now seen corresponding path program 1 times [2025-03-04 11:14:33,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:33,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152784996] [2025-03-04 11:14:33,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:33,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:33,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 11:14:33,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 11:14:33,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:33,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:14:33,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426443912] [2025-03-04 11:14:33,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:33,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:33,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:33,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:33,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:14:33,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 11:14:33,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 11:14:33,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:33,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:33,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:14:33,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:33,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:14:33,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:33,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152784996] [2025-03-04 11:14:33,797 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:14:33,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426443912] [2025-03-04 11:14:33,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426443912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:33,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:33,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:14:33,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252754951] [2025-03-04 11:14:33,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:33,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:14:33,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:33,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:14:33,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:14:33,799 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:14:33,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:33,868 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2025-03-04 11:14:33,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:14:33,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-04 11:14:33,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:33,869 INFO L225 Difference]: With dead ends: 105 [2025-03-04 11:14:33,869 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 11:14:33,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:14:33,870 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 29 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:33,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:33,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 11:14:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-03-04 11:14:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.639344262295082) internal successors, (100), 82 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:14:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2025-03-04 11:14:33,878 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 18 [2025-03-04 11:14:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:33,879 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2025-03-04 11:14:33,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:14:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2025-03-04 11:14:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 11:14:33,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:33,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:33,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:14:34,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:34,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:34,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1459629483, now seen corresponding path program 1 times [2025-03-04 11:14:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:34,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442478825] [2025-03-04 11:14:34,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:34,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:34,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 11:14:34,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 11:14:34,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:34,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:34,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:34,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442478825] [2025-03-04 11:14:34,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442478825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:34,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:34,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:14:34,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668072346] [2025-03-04 11:14:34,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:34,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:14:34,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:34,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:14:34,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:34,168 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:14:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:34,259 INFO L93 Difference]: Finished difference Result 139 states and 176 transitions. [2025-03-04 11:14:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:14:34,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-04 11:14:34,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:34,262 INFO L225 Difference]: With dead ends: 139 [2025-03-04 11:14:34,263 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 11:14:34,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:34,263 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 42 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:34,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 92 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:34,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 11:14:34,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2025-03-04 11:14:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.5894736842105264) internal successors, (151), 116 states have internal predecessors, (151), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:14:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 163 transitions. [2025-03-04 11:14:34,273 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 163 transitions. Word has length 20 [2025-03-04 11:14:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:34,273 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 163 transitions. [2025-03-04 11:14:34,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:14:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 163 transitions. [2025-03-04 11:14:34,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 11:14:34,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:34,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:34,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:14:34,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:34,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:34,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1996126294, now seen corresponding path program 1 times [2025-03-04 11:14:34,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:34,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901435767] [2025-03-04 11:14:34,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:34,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:34,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 11:14:34,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 11:14:34,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:34,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:34,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:34,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901435767] [2025-03-04 11:14:34,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901435767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:34,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:34,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:14:34,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096036551] [2025-03-04 11:14:34,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:34,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:14:34,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:34,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:14:34,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:34,379 INFO L87 Difference]: Start difference. First operand 125 states and 163 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:14:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:34,465 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2025-03-04 11:14:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:14:34,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-04 11:14:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:34,467 INFO L225 Difference]: With dead ends: 136 [2025-03-04 11:14:34,467 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 11:14:34,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:34,468 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 42 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:34,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 96 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:34,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 11:14:34,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2025-03-04 11:14:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.5604395604395604) internal successors, (142), 112 states have internal predecessors, (142), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:14:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2025-03-04 11:14:34,482 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 154 transitions. Word has length 21 [2025-03-04 11:14:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:34,482 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 154 transitions. [2025-03-04 11:14:34,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:14:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 154 transitions. [2025-03-04 11:14:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 11:14:34,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:34,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:34,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:14:34,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:34,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1750372979, now seen corresponding path program 1 times [2025-03-04 11:14:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263440278] [2025-03-04 11:14:34,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:34,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:34,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 11:14:34,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 11:14:34,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:34,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:14:34,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:34,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263440278] [2025-03-04 11:14:34,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263440278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:34,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724979716] [2025-03-04 11:14:34,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:34,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:34,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:34,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:34,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:14:34,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 11:14:34,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 11:14:34,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:34,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:34,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:14:34,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:34,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:14:34,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724979716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:34,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:14:34,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-04 11:14:34,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470928079] [2025-03-04 11:14:34,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:34,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:14:34,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:34,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:14:34,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:14:34,795 INFO L87 Difference]: Start difference. First operand 121 states and 154 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:14:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:34,887 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2025-03-04 11:14:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:14:34,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-04 11:14:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:34,888 INFO L225 Difference]: With dead ends: 124 [2025-03-04 11:14:34,889 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 11:14:34,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:14:34,890 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 81 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:34,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 11:14:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2025-03-04 11:14:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 112 states have internal predecessors, (141), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:14:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2025-03-04 11:14:34,909 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 22 [2025-03-04 11:14:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:34,909 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2025-03-04 11:14:34,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:14:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2025-03-04 11:14:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:14:34,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:34,909 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:34,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:35,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:35,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:35,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1573012492, now seen corresponding path program 1 times [2025-03-04 11:14:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:35,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419077141] [2025-03-04 11:14:35,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:35,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:14:35,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:14:35,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:35,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:14:35,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790092350] [2025-03-04 11:14:35,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:35,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:35,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:35,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:35,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:14:35,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:14:35,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:14:35,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:35,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:35,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:14:35,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:35,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:14:35,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:35,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419077141] [2025-03-04 11:14:35,247 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:14:35,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790092350] [2025-03-04 11:14:35,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790092350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:35,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:35,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:14:35,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078228795] [2025-03-04 11:14:35,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:35,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:14:35,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:35,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:14:35,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:35,249 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:14:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:35,320 INFO L93 Difference]: Finished difference Result 122 states and 153 transitions. [2025-03-04 11:14:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:14:35,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-04 11:14:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:35,321 INFO L225 Difference]: With dead ends: 122 [2025-03-04 11:14:35,321 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 11:14:35,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:14:35,322 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 74 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:35,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 81 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 11:14:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-04 11:14:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 112 states have internal predecessors, (140), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:14:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 152 transitions. [2025-03-04 11:14:35,329 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 152 transitions. Word has length 23 [2025-03-04 11:14:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:35,329 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 152 transitions. [2025-03-04 11:14:35,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:14:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 152 transitions. [2025-03-04 11:14:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:14:35,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:35,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:35,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:35,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:35,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:35,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:35,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1588865637, now seen corresponding path program 1 times [2025-03-04 11:14:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:35,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407167535] [2025-03-04 11:14:35,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:35,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:35,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:14:35,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:14:35,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:35,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:14:35,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:35,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407167535] [2025-03-04 11:14:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407167535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:35,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888040237] [2025-03-04 11:14:35,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:35,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:35,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:35,600 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:35,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:14:35,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:14:35,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:14:35,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:35,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:35,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:14:35,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:14:35,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:14:35,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888040237] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:35,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:35,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 11:14:35,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058761467] [2025-03-04 11:14:35,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:35,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:14:35,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:35,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:14:35,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:14:35,739 INFO L87 Difference]: Start difference. First operand 121 states and 152 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:14:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:35,822 INFO L93 Difference]: Finished difference Result 192 states and 239 transitions. [2025-03-04 11:14:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:14:35,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 35 [2025-03-04 11:14:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:35,824 INFO L225 Difference]: With dead ends: 192 [2025-03-04 11:14:35,824 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 11:14:35,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:14:35,825 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 150 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:35,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 249 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:35,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 11:14:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 168. [2025-03-04 11:14:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.5441176470588236) internal successors, (210), 157 states have internal predecessors, (210), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:14:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 226 transitions. [2025-03-04 11:14:35,844 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 226 transitions. Word has length 35 [2025-03-04 11:14:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:35,846 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 226 transitions. [2025-03-04 11:14:35,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:14:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 226 transitions. [2025-03-04 11:14:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:14:35,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:35,847 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:35,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:36,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:36,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:36,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2010194509, now seen corresponding path program 1 times [2025-03-04 11:14:36,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:36,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554350180] [2025-03-04 11:14:36,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:36,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:36,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:14:36,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:14:36,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:36,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:36,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:36,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554350180] [2025-03-04 11:14:36,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554350180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:36,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:36,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:14:36,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966369041] [2025-03-04 11:14:36,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:36,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:14:36,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:36,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:14:36,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:36,095 INFO L87 Difference]: Start difference. First operand 168 states and 226 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:14:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:36,118 INFO L93 Difference]: Finished difference Result 178 states and 235 transitions. [2025-03-04 11:14:36,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:14:36,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-04 11:14:36,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:36,120 INFO L225 Difference]: With dead ends: 178 [2025-03-04 11:14:36,120 INFO L226 Difference]: Without dead ends: 176 [2025-03-04 11:14:36,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:14:36,121 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 80 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:36,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 79 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-04 11:14:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2025-03-04 11:14:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 136 states have (on average 1.5073529411764706) internal successors, (205), 155 states have internal predecessors, (205), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:14:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 221 transitions. [2025-03-04 11:14:36,131 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 221 transitions. Word has length 36 [2025-03-04 11:14:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:36,131 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 221 transitions. [2025-03-04 11:14:36,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:14:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 221 transitions. [2025-03-04 11:14:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 11:14:36,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:36,132 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:36,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:14:36,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:36,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 938360849, now seen corresponding path program 1 times [2025-03-04 11:14:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:36,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637632484] [2025-03-04 11:14:36,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:36,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 11:14:36,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 11:14:36,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:36,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:36,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637632484] [2025-03-04 11:14:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637632484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:36,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877796406] [2025-03-04 11:14:36,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:36,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:36,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:36,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:36,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:14:36,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 11:14:36,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 11:14:36,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:36,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:36,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:14:36,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:36,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:14:36,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877796406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:36,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:14:36,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:14:36,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419894882] [2025-03-04 11:14:36,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:36,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:14:36,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:36,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:14:36,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:14:36,319 INFO L87 Difference]: Start difference. First operand 166 states and 221 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:14:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:36,348 INFO L93 Difference]: Finished difference Result 166 states and 221 transitions. [2025-03-04 11:14:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:14:36,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-03-04 11:14:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:36,349 INFO L225 Difference]: With dead ends: 166 [2025-03-04 11:14:36,349 INFO L226 Difference]: Without dead ends: 165 [2025-03-04 11:14:36,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:14:36,350 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 42 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:36,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 166 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-04 11:14:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-04 11:14:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 136 states have (on average 1.4705882352941178) internal successors, (200), 154 states have internal predecessors, (200), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:14:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 216 transitions. [2025-03-04 11:14:36,361 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 216 transitions. Word has length 38 [2025-03-04 11:14:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:36,361 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 216 transitions. [2025-03-04 11:14:36,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:14:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 216 transitions. [2025-03-04 11:14:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 11:14:36,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:36,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:36,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 11:14:36,562 WARN L453 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-03-04 11:14:36,562 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:36,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:36,562 INFO L85 PathProgramCache]: Analyzing trace with hash -975584732, now seen corresponding path program 1 times [2025-03-04 11:14:36,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:36,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967857280] [2025-03-04 11:14:36,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:36,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:36,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 11:14:36,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 11:14:36,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:36,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:36,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:36,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967857280] [2025-03-04 11:14:36,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967857280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:36,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881904724] [2025-03-04 11:14:36,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:36,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:36,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:36,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:36,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:14:36,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 11:14:36,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 11:14:36,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:36,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:36,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:14:36,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:36,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:14:36,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881904724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:36,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:14:36,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:14:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419026037] [2025-03-04 11:14:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:36,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:14:36,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:36,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:14:36,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:14:36,708 INFO L87 Difference]: Start difference. First operand 165 states and 216 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:14:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:36,741 INFO L93 Difference]: Finished difference Result 175 states and 225 transitions. [2025-03-04 11:14:36,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:14:36,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-03-04 11:14:36,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:36,742 INFO L225 Difference]: With dead ends: 175 [2025-03-04 11:14:36,742 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 11:14:36,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:14:36,743 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 40 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:36,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 187 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:36,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 11:14:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2025-03-04 11:14:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 153 states have internal predecessors, (195), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:14:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 211 transitions. [2025-03-04 11:14:36,753 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 211 transitions. Word has length 39 [2025-03-04 11:14:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:36,753 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 211 transitions. [2025-03-04 11:14:36,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:14:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 211 transitions. [2025-03-04 11:14:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 11:14:36,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:36,755 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:36,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:14:36,960 WARN L453 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-03-04 11:14:36,960 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1234056318, now seen corresponding path program 1 times [2025-03-04 11:14:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808547797] [2025-03-04 11:14:36,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:36,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 11:14:36,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 11:14:36,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:36,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:14:36,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119897483] [2025-03-04 11:14:36,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:36,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:36,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:36,973 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:36,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:14:36,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 11:14:37,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 11:14:37,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:37,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:37,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:14:37,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:37,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:37,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:37,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808547797] [2025-03-04 11:14:37,252 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:14:37,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119897483] [2025-03-04 11:14:37,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119897483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:37,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:14:37,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 11:14:37,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339716140] [2025-03-04 11:14:37,252 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:37,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:14:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:37,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:14:37,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:14:37,253 INFO L87 Difference]: Start difference. First operand 164 states and 211 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:14:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:37,359 INFO L93 Difference]: Finished difference Result 171 states and 214 transitions. [2025-03-04 11:14:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:14:37,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-03-04 11:14:37,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:37,360 INFO L225 Difference]: With dead ends: 171 [2025-03-04 11:14:37,360 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 11:14:37,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:14:37,361 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:37,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 92 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:37,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 11:14:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2025-03-04 11:14:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 149 states have internal predecessors, (182), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:14:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 198 transitions. [2025-03-04 11:14:37,378 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 198 transitions. Word has length 41 [2025-03-04 11:14:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:37,378 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 198 transitions. [2025-03-04 11:14:37,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:14:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 198 transitions. [2025-03-04 11:14:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 11:14:37,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:37,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:37,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:37,579 WARN L453 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-03-04 11:14:37,579 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:37,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:37,580 INFO L85 PathProgramCache]: Analyzing trace with hash 398959821, now seen corresponding path program 1 times [2025-03-04 11:14:37,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:37,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915831176] [2025-03-04 11:14:37,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:37,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:37,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 11:14:37,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:14:37,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:37,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:14:37,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228393145] [2025-03-04 11:14:37,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:37,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:37,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:37,590 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:37,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:14:37,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 11:14:37,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:14:37,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:37,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:37,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:14:37,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:37,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:37,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:37,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915831176] [2025-03-04 11:14:37,920 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:14:37,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228393145] [2025-03-04 11:14:37,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228393145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:37,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:14:37,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 11:14:37,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067185846] [2025-03-04 11:14:37,921 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:37,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:14:37,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:37,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:14:37,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:14:37,922 INFO L87 Difference]: Start difference. First operand 160 states and 198 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:14:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:38,009 INFO L93 Difference]: Finished difference Result 216 states and 266 transitions. [2025-03-04 11:14:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:14:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-03-04 11:14:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:38,010 INFO L225 Difference]: With dead ends: 216 [2025-03-04 11:14:38,010 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 11:14:38,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:14:38,011 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 104 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:38,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 116 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:38,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 11:14:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 203. [2025-03-04 11:14:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 178 states have (on average 1.3089887640449438) internal successors, (233), 190 states have internal predecessors, (233), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:14:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 253 transitions. [2025-03-04 11:14:38,018 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 253 transitions. Word has length 42 [2025-03-04 11:14:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:38,019 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 253 transitions. [2025-03-04 11:14:38,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:14:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2025-03-04 11:14:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 11:14:38,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:38,019 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:38,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:38,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 11:14:38,224 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:38,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:38,224 INFO L85 PathProgramCache]: Analyzing trace with hash 326932543, now seen corresponding path program 1 times [2025-03-04 11:14:38,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:38,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242006838] [2025-03-04 11:14:38,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:38,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:38,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:14:38,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:14:38,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:38,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:38,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:38,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242006838] [2025-03-04 11:14:38,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242006838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:38,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449323188] [2025-03-04 11:14:38,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:38,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:38,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:38,273 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:38,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:14:38,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:14:38,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:14:38,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:38,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:38,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:14:38,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:38,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:14:38,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449323188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:38,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:14:38,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 11:14:38,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182518011] [2025-03-04 11:14:38,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:38,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:14:38,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:38,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:14:38,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:14:38,392 INFO L87 Difference]: Start difference. First operand 203 states and 253 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:14:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:38,453 INFO L93 Difference]: Finished difference Result 203 states and 253 transitions. [2025-03-04 11:14:38,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:14:38,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-03-04 11:14:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:38,455 INFO L225 Difference]: With dead ends: 203 [2025-03-04 11:14:38,455 INFO L226 Difference]: Without dead ends: 201 [2025-03-04 11:14:38,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:14:38,455 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:38,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 70 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:38,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-04 11:14:38,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2025-03-04 11:14:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 175 states have (on average 1.2971428571428572) internal successors, (227), 185 states have internal predecessors, (227), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:14:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2025-03-04 11:14:38,463 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 43 [2025-03-04 11:14:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:38,463 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2025-03-04 11:14:38,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:14:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2025-03-04 11:14:38,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:14:38,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:38,463 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:38,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:38,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:14:38,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:38,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1544974252, now seen corresponding path program 1 times [2025-03-04 11:14:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:38,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525746315] [2025-03-04 11:14:38,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:38,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:38,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:14:38,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:14:38,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:38,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:38,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525746315] [2025-03-04 11:14:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525746315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721590904] [2025-03-04 11:14:38,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:38,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:38,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:38,745 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:38,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:14:38,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:14:38,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:14:38,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:38,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:38,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:14:38,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:38,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:38,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721590904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:38,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:14:38,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2025-03-04 11:14:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961020789] [2025-03-04 11:14:38,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:38,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:14:38,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:38,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:14:38,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:14:38,918 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:14:39,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:39,058 INFO L93 Difference]: Finished difference Result 206 states and 251 transitions. [2025-03-04 11:14:39,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:14:39,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2025-03-04 11:14:39,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:39,060 INFO L225 Difference]: With dead ends: 206 [2025-03-04 11:14:39,060 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 11:14:39,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:14:39,060 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:39,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 192 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 11:14:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-03-04 11:14:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 175 states have (on average 1.2685714285714285) internal successors, (222), 185 states have internal predecessors, (222), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:14:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 242 transitions. [2025-03-04 11:14:39,067 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 242 transitions. Word has length 44 [2025-03-04 11:14:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:39,067 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 242 transitions. [2025-03-04 11:14:39,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:14:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 242 transitions. [2025-03-04 11:14:39,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:14:39,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:39,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:39,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:39,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:14:39,272 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:39,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1237532222, now seen corresponding path program 1 times [2025-03-04 11:14:39,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:39,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237762737] [2025-03-04 11:14:39,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:39,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:14:39,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:14:39,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:39,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:14:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237762737] [2025-03-04 11:14:39,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237762737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47019634] [2025-03-04 11:14:39,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:39,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:39,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:39,392 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:39,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:14:39,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:14:39,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:14:39,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:39,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:39,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:14:39,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:14:39,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:14:39,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47019634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:39,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:39,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-04 11:14:39,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417598955] [2025-03-04 11:14:39,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:39,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:14:39,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:39,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:14:39,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:14:39,683 INFO L87 Difference]: Start difference. First operand 198 states and 242 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:14:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:39,922 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2025-03-04 11:14:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:14:39,924 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2025-03-04 11:14:39,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:39,924 INFO L225 Difference]: With dead ends: 208 [2025-03-04 11:14:39,924 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 11:14:39,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:14:39,925 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 185 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:39,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 149 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 11:14:39,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 166. [2025-03-04 11:14:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 154 states have internal predecessors, (180), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:14:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 198 transitions. [2025-03-04 11:14:39,931 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 198 transitions. Word has length 45 [2025-03-04 11:14:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:39,931 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 198 transitions. [2025-03-04 11:14:39,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:14:39,931 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 198 transitions. [2025-03-04 11:14:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:14:39,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:39,932 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:39,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:40,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:14:40,132 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:40,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash -291206775, now seen corresponding path program 1 times [2025-03-04 11:14:40,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:40,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729146212] [2025-03-04 11:14:40,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:40,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:14:40,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:14:40,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:40,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:14:40,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287371740] [2025-03-04 11:14:40,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:40,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:40,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:40,144 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:40,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:14:40,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:14:40,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:14:40,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:40,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:40,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:14:40,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:40,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:40,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:40,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729146212] [2025-03-04 11:14:40,405 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:14:40,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287371740] [2025-03-04 11:14:40,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287371740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:40,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:14:40,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-04 11:14:40,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182629642] [2025-03-04 11:14:40,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:40,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:14:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:40,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:14:40,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:14:40,407 INFO L87 Difference]: Start difference. First operand 166 states and 198 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:14:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:40,598 INFO L93 Difference]: Finished difference Result 273 states and 325 transitions. [2025-03-04 11:14:40,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:14:40,598 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2025-03-04 11:14:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:40,599 INFO L225 Difference]: With dead ends: 273 [2025-03-04 11:14:40,599 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 11:14:40,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:14:40,600 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 109 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:40,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 112 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 11:14:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2025-03-04 11:14:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 165 states have (on average 1.1636363636363636) internal successors, (192), 171 states have internal predecessors, (192), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:14:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2025-03-04 11:14:40,609 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 46 [2025-03-04 11:14:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:40,609 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2025-03-04 11:14:40,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:14:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2025-03-04 11:14:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 11:14:40,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:40,609 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:40,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:14:40,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:14:40,810 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:40,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:40,810 INFO L85 PathProgramCache]: Analyzing trace with hash 528317720, now seen corresponding path program 2 times [2025-03-04 11:14:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:40,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282325017] [2025-03-04 11:14:40,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:40,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 11:14:40,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:14:40,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:40,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:14:40,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1242274315] [2025-03-04 11:14:40,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:40,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:40,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:40,829 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:40,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:14:40,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 11:14:40,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:14:40,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:40,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:40,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:14:40,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:14:40,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:14:41,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282325017] [2025-03-04 11:14:41,131 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:14:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242274315] [2025-03-04 11:14:41,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242274315] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:41,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:14:41,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 11:14:41,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521835683] [2025-03-04 11:14:41,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:41,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:14:41,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:41,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:14:41,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:14:41,132 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand has 10 states, 9 states have (on average 10.444444444444445) internal successors, (94), 10 states have internal predecessors, (94), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:14:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:41,532 INFO L93 Difference]: Finished difference Result 387 states and 459 transitions. [2025-03-04 11:14:41,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:14:41,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.444444444444445) internal successors, (94), 10 states have internal predecessors, (94), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 65 [2025-03-04 11:14:41,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:41,534 INFO L225 Difference]: With dead ends: 387 [2025-03-04 11:14:41,534 INFO L226 Difference]: Without dead ends: 376 [2025-03-04 11:14:41,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:14:41,534 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 155 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:41,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 300 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:14:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-04 11:14:41,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 354. [2025-03-04 11:14:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 327 states have (on average 1.1681957186544343) internal successors, (382), 333 states have internal predecessors, (382), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 11:14:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 418 transitions. [2025-03-04 11:14:41,555 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 418 transitions. Word has length 65 [2025-03-04 11:14:41,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:41,555 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 418 transitions. [2025-03-04 11:14:41,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.444444444444445) internal successors, (94), 10 states have internal predecessors, (94), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:14:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 418 transitions. [2025-03-04 11:14:41,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 11:14:41,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:41,555 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:41,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:41,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:14:41,760 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:41,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash 301635478, now seen corresponding path program 2 times [2025-03-04 11:14:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:41,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892960260] [2025-03-04 11:14:41,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:41,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-04 11:14:41,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 11:14:41,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:41,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:14:41,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:41,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892960260] [2025-03-04 11:14:41,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892960260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:41,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319850005] [2025-03-04 11:14:41,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:41,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:41,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:41,859 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:41,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:14:41,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-04 11:14:41,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 11:14:41,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:41,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:41,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:14:41,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:14:42,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:42,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319850005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:42,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:14:42,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2025-03-04 11:14:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715810559] [2025-03-04 11:14:42,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:42,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:14:42,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:42,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:14:42,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:14:42,075 INFO L87 Difference]: Start difference. First operand 354 states and 418 transitions. Second operand has 11 states, 10 states have (on average 10.1) internal successors, (101), 11 states have internal predecessors, (101), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:14:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:42,245 INFO L93 Difference]: Finished difference Result 383 states and 450 transitions. [2025-03-04 11:14:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:14:42,245 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.1) internal successors, (101), 11 states have internal predecessors, (101), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 67 [2025-03-04 11:14:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:42,248 INFO L225 Difference]: With dead ends: 383 [2025-03-04 11:14:42,248 INFO L226 Difference]: Without dead ends: 375 [2025-03-04 11:14:42,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:14:42,248 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:42,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 189 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-04 11:14:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2025-03-04 11:14:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 345 states have (on average 1.1623188405797102) internal successors, (401), 351 states have internal predecessors, (401), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 11:14:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 439 transitions. [2025-03-04 11:14:42,273 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 439 transitions. Word has length 67 [2025-03-04 11:14:42,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:42,273 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 439 transitions. [2025-03-04 11:14:42,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.1) internal successors, (101), 11 states have internal predecessors, (101), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:14:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 439 transitions. [2025-03-04 11:14:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 11:14:42,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:42,274 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:42,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:14:42,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:42,475 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:42,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash -730864820, now seen corresponding path program 1 times [2025-03-04 11:14:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:42,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925474576] [2025-03-04 11:14:42,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:42,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:42,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:14:42,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:14:42,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:42,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 56 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:14:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925474576] [2025-03-04 11:14:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925474576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492891042] [2025-03-04 11:14:42,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:42,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:42,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:42,568 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:42,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:14:42,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:14:42,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:14:42,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:42,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:42,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:14:42,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 56 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:14:42,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 47 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:14:42,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492891042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:42,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:42,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-04 11:14:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152275755] [2025-03-04 11:14:42,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:42,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:14:42,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:42,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:14:42,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:14:42,733 INFO L87 Difference]: Start difference. First operand 373 states and 439 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:14:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:42,792 INFO L93 Difference]: Finished difference Result 512 states and 592 transitions. [2025-03-04 11:14:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:14:42,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 90 [2025-03-04 11:14:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:42,794 INFO L225 Difference]: With dead ends: 512 [2025-03-04 11:14:42,794 INFO L226 Difference]: Without dead ends: 344 [2025-03-04 11:14:42,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:14:42,796 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 17 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:42,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 134 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-04 11:14:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2025-03-04 11:14:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 315 states have (on average 1.1206349206349207) internal successors, (353), 321 states have internal predecessors, (353), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 11:14:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 387 transitions. [2025-03-04 11:14:42,811 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 387 transitions. Word has length 90 [2025-03-04 11:14:42,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:42,811 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 387 transitions. [2025-03-04 11:14:42,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:14:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 387 transitions. [2025-03-04 11:14:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 11:14:42,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:42,813 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:42,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:14:43,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:43,016 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:43,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash -846990835, now seen corresponding path program 2 times [2025-03-04 11:14:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:43,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581006615] [2025-03-04 11:14:43,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:43,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-03-04 11:14:43,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:14:43,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:43,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 14 proven. 27 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:14:43,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:43,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581006615] [2025-03-04 11:14:43,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581006615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:43,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114706945] [2025-03-04 11:14:43,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:43,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:43,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:43,239 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:43,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:14:43,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-03-04 11:14:43,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:14:43,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:43,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:43,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:14:43,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 11:14:43,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 11:14:43,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114706945] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:43,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:43,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2025-03-04 11:14:43,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409783683] [2025-03-04 11:14:43,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:43,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 11:14:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:43,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 11:14:43,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:14:43,588 INFO L87 Difference]: Start difference. First operand 341 states and 387 transitions. Second operand has 23 states, 22 states have (on average 7.954545454545454) internal successors, (175), 22 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-04 11:14:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:44,795 INFO L93 Difference]: Finished difference Result 759 states and 878 transitions. [2025-03-04 11:14:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-04 11:14:44,796 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 7.954545454545454) internal successors, (175), 22 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 90 [2025-03-04 11:14:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:44,798 INFO L225 Difference]: With dead ends: 759 [2025-03-04 11:14:44,798 INFO L226 Difference]: Without dead ends: 725 [2025-03-04 11:14:44,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1935 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1350, Invalid=4502, Unknown=0, NotChecked=0, Total=5852 [2025-03-04 11:14:44,801 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 505 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:44,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 295 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:14:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-04 11:14:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 335. [2025-03-04 11:14:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 311 states have (on average 1.0836012861736335) internal successors, (337), 315 states have internal predecessors, (337), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 11:14:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 371 transitions. [2025-03-04 11:14:44,820 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 371 transitions. Word has length 90 [2025-03-04 11:14:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:44,820 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 371 transitions. [2025-03-04 11:14:44,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 7.954545454545454) internal successors, (175), 22 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-04 11:14:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 371 transitions. [2025-03-04 11:14:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 11:14:44,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:44,821 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:44,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:45,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:45,022 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:45,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1827248542, now seen corresponding path program 1 times [2025-03-04 11:14:45,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:45,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011021987] [2025-03-04 11:14:45,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:45,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:45,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 11:14:45,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 11:14:45,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:45,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-04 11:14:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011021987] [2025-03-04 11:14:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011021987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104855677] [2025-03-04 11:14:45,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:45,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:45,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:45,066 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:45,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:14:45,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 11:14:45,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 11:14:45,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:45,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:45,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:14:45,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-04 11:14:45,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-04 11:14:45,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104855677] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:45,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:45,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:14:45,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784590022] [2025-03-04 11:14:45,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:45,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:14:45,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:45,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:14:45,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:14:45,193 INFO L87 Difference]: Start difference. First operand 335 states and 371 transitions. Second operand has 7 states, 6 states have (on average 19.333333333333332) internal successors, (116), 7 states have internal predecessors, (116), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 11:14:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:45,261 INFO L93 Difference]: Finished difference Result 514 states and 581 transitions. [2025-03-04 11:14:45,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:14:45,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 19.333333333333332) internal successors, (116), 7 states have internal predecessors, (116), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 100 [2025-03-04 11:14:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:45,264 INFO L225 Difference]: With dead ends: 514 [2025-03-04 11:14:45,264 INFO L226 Difference]: Without dead ends: 512 [2025-03-04 11:14:45,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:14:45,264 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:45,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 136 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-04 11:14:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-03-04 11:14:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 479 states have (on average 1.058455114822547) internal successors, (507), 482 states have internal predecessors, (507), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 11:14:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 561 transitions. [2025-03-04 11:14:45,296 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 561 transitions. Word has length 100 [2025-03-04 11:14:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:45,296 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 561 transitions. [2025-03-04 11:14:45,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 19.333333333333332) internal successors, (116), 7 states have internal predecessors, (116), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 11:14:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 561 transitions. [2025-03-04 11:14:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 11:14:45,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:45,297 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:45,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:45,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:45,497 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:45,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash -360641376, now seen corresponding path program 1 times [2025-03-04 11:14:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:45,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691254445] [2025-03-04 11:14:45,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:45,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:45,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 11:14:45,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 11:14:45,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:45,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:14:45,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:45,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691254445] [2025-03-04 11:14:45,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691254445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:45,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213348234] [2025-03-04 11:14:45,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:45,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:45,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:45,559 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:45,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:14:45,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 11:14:45,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 11:14:45,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:45,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:45,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:14:45,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:14:45,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:14:45,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213348234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:45,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:45,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 11:14:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081461974] [2025-03-04 11:14:45,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:45,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:14:45,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:45,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:14:45,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:14:45,756 INFO L87 Difference]: Start difference. First operand 512 states and 561 transitions. Second operand has 11 states, 10 states have (on average 16.7) internal successors, (167), 11 states have internal predecessors, (167), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-04 11:14:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:45,882 INFO L93 Difference]: Finished difference Result 1219 states and 1361 transitions. [2025-03-04 11:14:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:14:45,882 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.7) internal successors, (167), 11 states have internal predecessors, (167), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 103 [2025-03-04 11:14:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:45,886 INFO L225 Difference]: With dead ends: 1219 [2025-03-04 11:14:45,886 INFO L226 Difference]: Without dead ends: 1218 [2025-03-04 11:14:45,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:14:45,887 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 112 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:45,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 213 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-03-04 11:14:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1198. [2025-03-04 11:14:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1129 states have (on average 1.070859167404783) internal successors, (1209), 1132 states have internal predecessors, (1209), 63 states have call successors, (63), 2 states have call predecessors, (63), 2 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 11:14:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1335 transitions. [2025-03-04 11:14:45,932 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1335 transitions. Word has length 103 [2025-03-04 11:14:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:45,933 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1335 transitions. [2025-03-04 11:14:45,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.7) internal successors, (167), 11 states have internal predecessors, (167), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-04 11:14:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1335 transitions. [2025-03-04 11:14:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 11:14:45,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:45,938 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:45,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:46,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:46,138 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:46,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:46,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1516179113, now seen corresponding path program 1 times [2025-03-04 11:14:46,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:46,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521000144] [2025-03-04 11:14:46,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:46,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:46,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 11:14:46,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 11:14:46,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:46,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 86 proven. 30 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 11:14:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:46,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521000144] [2025-03-04 11:14:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521000144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:46,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358602390] [2025-03-04 11:14:46,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:46,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:46,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:46,208 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:46,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 11:14:46,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 11:14:46,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 11:14:46,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:46,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:46,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:14:46,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 98 proven. 30 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 11:14:46,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 86 proven. 30 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 11:14:46,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358602390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:46,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:46,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-04 11:14:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886080238] [2025-03-04 11:14:46,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:46,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:14:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:46,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:14:46,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:14:46,416 INFO L87 Difference]: Start difference. First operand 1198 states and 1335 transitions. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-04 11:14:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:46,574 INFO L93 Difference]: Finished difference Result 1279 states and 1421 transitions. [2025-03-04 11:14:46,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:14:46,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 111 [2025-03-04 11:14:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:46,578 INFO L225 Difference]: With dead ends: 1279 [2025-03-04 11:14:46,578 INFO L226 Difference]: Without dead ends: 1125 [2025-03-04 11:14:46,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:14:46,580 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 39 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:46,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 217 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-03-04 11:14:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1121. [2025-03-04 11:14:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1055 states have (on average 1.0597156398104266) internal successors, (1118), 1058 states have internal predecessors, (1118), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 11:14:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1238 transitions. [2025-03-04 11:14:46,618 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1238 transitions. Word has length 111 [2025-03-04 11:14:46,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:46,619 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1238 transitions. [2025-03-04 11:14:46,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-04 11:14:46,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1238 transitions. [2025-03-04 11:14:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 11:14:46,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:46,621 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:46,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:46,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:46,823 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:46,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:46,823 INFO L85 PathProgramCache]: Analyzing trace with hash 412288807, now seen corresponding path program 1 times [2025-03-04 11:14:46,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:46,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602312223] [2025-03-04 11:14:46,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:46,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:46,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 11:14:46,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 11:14:46,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:46,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 11:14:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:46,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602312223] [2025-03-04 11:14:46,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602312223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:46,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666176095] [2025-03-04 11:14:46,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:46,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:46,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:46,888 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:46,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 11:14:46,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 11:14:46,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 11:14:46,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:46,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:46,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:14:46,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 11:14:47,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 11:14:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666176095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:47,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:47,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 11:14:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840152167] [2025-03-04 11:14:47,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:47,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:14:47,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:47,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:14:47,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:14:47,142 INFO L87 Difference]: Start difference. First operand 1121 states and 1238 transitions. Second operand has 13 states, 12 states have (on average 16.416666666666668) internal successors, (197), 13 states have internal predecessors, (197), 12 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-04 11:14:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:47,295 INFO L93 Difference]: Finished difference Result 2262 states and 2558 transitions. [2025-03-04 11:14:47,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:14:47,296 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 16.416666666666668) internal successors, (197), 13 states have internal predecessors, (197), 12 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 123 [2025-03-04 11:14:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:47,301 INFO L225 Difference]: With dead ends: 2262 [2025-03-04 11:14:47,301 INFO L226 Difference]: Without dead ends: 2261 [2025-03-04 11:14:47,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:14:47,303 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:47,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 162 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2025-03-04 11:14:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2025-03-04 11:14:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2135 states have (on average 1.0576112412177987) internal successors, (2258), 2138 states have internal predecessors, (2258), 120 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-04 11:14:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2498 transitions. [2025-03-04 11:14:47,401 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2498 transitions. Word has length 123 [2025-03-04 11:14:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:47,402 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 2498 transitions. [2025-03-04 11:14:47,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 16.416666666666668) internal successors, (197), 13 states have internal predecessors, (197), 12 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-04 11:14:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2498 transitions. [2025-03-04 11:14:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 11:14:47,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:47,404 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:47,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 11:14:47,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 11:14:47,604 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:14:47,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:47,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1833130828, now seen corresponding path program 2 times [2025-03-04 11:14:47,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:47,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144111020] [2025-03-04 11:14:47,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:47,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-03-04 11:14:47,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 11:14:47,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:47,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 68 proven. 128 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 11:14:47,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:47,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144111020] [2025-03-04 11:14:47,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144111020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:47,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902881853] [2025-03-04 11:14:47,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:47,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:47,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:47,704 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:47,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 11:14:47,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-03-04 11:14:47,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 11:14:47,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:47,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:47,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:14:47,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 231 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:14:47,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 191 proven. 5 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 11:14:48,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902881853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:48,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:48,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 14] total 20 [2025-03-04 11:14:48,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035694799] [2025-03-04 11:14:48,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:48,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:14:48,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:48,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:14:48,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:14:48,148 INFO L87 Difference]: Start difference. First operand 2261 states and 2498 transitions. Second operand has 20 states, 20 states have (on average 11.0) internal successors, (220), 20 states have internal predecessors, (220), 12 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) [2025-03-04 11:14:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:49,055 INFO L93 Difference]: Finished difference Result 2397 states and 2634 transitions. [2025-03-04 11:14:49,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-04 11:14:49,056 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.0) internal successors, (220), 20 states have internal predecessors, (220), 12 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) Word has length 134 [2025-03-04 11:14:49,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:49,056 INFO L225 Difference]: With dead ends: 2397 [2025-03-04 11:14:49,056 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:14:49,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 245 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1148, Invalid=4552, Unknown=0, NotChecked=0, Total=5700 [2025-03-04 11:14:49,060 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 139 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:49,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 847 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:14:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:14:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:14:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:14:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:14:49,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2025-03-04 11:14:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:49,063 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:14:49,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.0) internal successors, (220), 20 states have internal predecessors, (220), 12 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) [2025-03-04 11:14:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:14:49,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:14:49,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-03-04 11:14:49,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-04 11:14:49,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-04 11:14:49,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-04 11:14:49,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-04 11:14:49,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 11:14:49,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 11:14:49,270 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:49,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:14:51,001 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:14:51,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:14:51 BoogieIcfgContainer [2025-03-04 11:14:51,029 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:14:51,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:14:51,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:14:51,029 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:14:51,033 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:14:33" (3/4) ... [2025-03-04 11:14:51,035 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:14:51,039 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 11:14:51,039 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 11:14:51,042 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 11:14:51,042 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:14:51,043 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:14:51,043 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:14:51,101 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:14:51,102 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:14:51,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:14:51,102 INFO L158 Benchmark]: Toolchain (without parser) took 18211.43ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 159.4MB in the beginning and 112.0MB in the end (delta: 47.4MB). Peak memory consumption was 134.3MB. Max. memory is 16.1GB. [2025-03-04 11:14:51,103 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:14:51,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 146.54ms. Allocated memory is still 201.3MB. Free memory was 159.4MB in the beginning and 148.4MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:14:51,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.35ms. Allocated memory is still 201.3MB. Free memory was 148.4MB in the beginning and 147.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:14:51,103 INFO L158 Benchmark]: Boogie Preprocessor took 18.38ms. Allocated memory is still 201.3MB. Free memory was 147.2MB in the beginning and 146.2MB in the end (delta: 946.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:14:51,103 INFO L158 Benchmark]: IcfgBuilder took 273.69ms. Allocated memory is still 201.3MB. Free memory was 145.9MB in the beginning and 131.3MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:14:51,103 INFO L158 Benchmark]: TraceAbstraction took 17676.45ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 130.7MB in the beginning and 117.0MB in the end (delta: 13.7MB). Peak memory consumption was 138.8MB. Max. memory is 16.1GB. [2025-03-04 11:14:51,104 INFO L158 Benchmark]: Witness Printer took 72.41ms. Allocated memory is still 293.6MB. Free memory was 117.0MB in the beginning and 112.0MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:14:51,104 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.71ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 146.54ms. Allocated memory is still 201.3MB. Free memory was 159.4MB in the beginning and 148.4MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.35ms. Allocated memory is still 201.3MB. Free memory was 148.4MB in the beginning and 147.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.38ms. Allocated memory is still 201.3MB. Free memory was 147.2MB in the beginning and 146.2MB in the end (delta: 946.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 273.69ms. Allocated memory is still 201.3MB. Free memory was 145.9MB in the beginning and 131.3MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17676.45ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 130.7MB in the beginning and 117.0MB in the end (delta: 13.7MB). Peak memory consumption was 138.8MB. Max. memory is 16.1GB. * Witness Printer took 72.41ms. Allocated memory is still 293.6MB. Free memory was 117.0MB in the beginning and 112.0MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 69 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 25, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2118 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2105 mSDsluCounter, 4531 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3390 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4632 IncrementalHoareTripleChecker+Invalid, 4821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 1141 mSDtfsCounter, 4632 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2549 GetRequests, 2192 SyntacticMatches, 21 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3947 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2261occurred in iteration=24, InterpolantAutomatonStates: 282, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 568 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2730 NumberOfCodeBlocks, 2730 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 3386 ConstructedInterpolants, 7 QuantifiedInterpolants, 11560 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2665 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 51 InterpolantComputations, 10 PerfectInterpolantSequences, 1907/3489 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 36]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483646)) && (2 <= x2)) && (y1 == 1)) && (y2 == 1)) && (counter <= 5)) && (x1 <= 2147483647)) && (x2 <= 1073741823)) && (3 <= counter)) && (0 <= y3)) || (((((((((0 <= x1) && (y2 == 0)) && (y1 == 1)) && (((long long) x2 + y3) <= 2147483647)) && (3 <= x2)) && (counter <= 5)) && (x1 <= 2147483647)) && (3 <= counter)) && (0 <= y3))) || (((((((x2 <= 2147483647) && (y2 == 0)) && (x1 == y3)) && (y1 == 0)) && (counter == 0)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (y1 <= 2147483643)) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= counter)) && (2 == y1)) && (x2 == 1)) && (y2 == 0)) && (x1 <= ((long long) 2 + y3))) && (counter <= 5)) && (y3 <= 2147483645)) && (0 <= y3))) || ((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (counter == 5)) && (y1 == 1)) && (3 <= x2)) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((((0 <= x1) && (x2 == 1)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (y2 == 0)) && (y1 <= 2147483644)) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (counter <= 5)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (3 <= counter)) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 <= counter)) && (2 <= x2)) && (y2 == 0)) && (y1 == 1)) && (((long long) x2 + y3) <= 2147483647)) && (x1 <= ((long long) 2 + y3))) && (counter <= 5)) && (x2 <= 1073741823)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 <= x2)) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (y1 == 1)) && (counter <= 5)) && (4 <= counter)) && (x1 <= 2147483647)) && (x2 <= 1073741823)) && (0 <= y3))) || (((((((((0 <= x1) && (x2 <= 2147483647)) && (x1 <= ((long long) y3 + 1))) && (y2 == 1)) && (y1 == 0)) && (1 <= counter)) && (counter <= 5)) && (y3 <= 2147483646)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= counter)) && (2 == y2)) && (x2 <= 2147483647)) && (y1 == 0)) && (x1 <= ((long long) 2 + y3))) && (counter <= 5)) && (y3 <= 2147483645)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= x2)) && (counter == 5)) && (y2 == 1)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || (((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483646)) && (y1 == 1)) && (y2 == 1)) && (3 <= x2)) && (counter <= 5)) && (4 <= counter)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((((0 <= x1) && (y3 <= 2147483647)) && (x2 <= 2147483647)) && (2 <= y2)) && (y1 == 0)) && (counter <= 5)) && (y2 <= 4)) && (((long long) y2 + y3) <= 2147483647)) && (4 <= counter)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((0 <= x1) && (x2 <= 2147483647)) && (counter == 5)) && (y2 <= 2147483642)) && (2 <= y2)) && (y1 == 0)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((((0 <= x1) && (y3 <= 2147483647)) && (x2 <= 2147483647)) && (2 <= y2)) && (y1 == 0)) && (counter <= 5)) && (y2 <= 3)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= 2147483647)) && (3 <= counter)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 <= x2)) && (y2 == 0)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (counter <= 5)) && (4 <= counter)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 <= x2)) && (counter == 5)) && (y1 == 1)) && (2 <= y2)) && ((((long long) x2 + y2) + y3) <= 2147483647)) && (y2 <= 3)) && (x1 <= 2147483647)) && (x2 <= 1073741823)) && (0 <= y3))) || (((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (y1 == 1)) && (x1 <= ((long long) y3 + 1))) && (1 <= counter)) && (counter <= 5)) && (y3 <= 2147483646)) && (0 <= y3))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:14:51,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE