./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.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 f50c7bc2857aa84cb02200a831151d15e1603828dabc8b6cfed5e5d60ae2ee71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:08:26,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:08:26,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:08:26,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:08:26,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:08:26,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:08:26,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:08:26,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:08:26,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:08:26,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:08:26,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:08:26,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:08:26,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:08:26,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:08:26,093 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:08:26,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:08:26,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:08:26,094 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:08:26,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:08:26,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:08:26,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:08:26,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:08:26,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:08:26,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:08:26,094 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:08:26,094 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:08:26,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:08:26,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:08:26,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:08:26,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:08:26,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:08:26,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:08:26,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:08:26,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:08:26,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:08:26,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:08:26,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:08:26,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:08:26,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:08:26,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:08:26,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:08:26,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:08:26,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:08:26,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:08:26,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:08:26,096 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 -> f50c7bc2857aa84cb02200a831151d15e1603828dabc8b6cfed5e5d60ae2ee71 [2025-03-17 15:08:26,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:08:26,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:08:26,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:08:26,333 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:08:26,333 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:08:26,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2025-03-17 15:08:27,499 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442d90e04/df405bfd25e048ee9bcabd363dc50378/FLAGee562d32a [2025-03-17 15:08:27,716 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:08:27,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2025-03-17 15:08:27,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442d90e04/df405bfd25e048ee9bcabd363dc50378/FLAGee562d32a [2025-03-17 15:08:28,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442d90e04/df405bfd25e048ee9bcabd363dc50378 [2025-03-17 15:08:28,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:08:28,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:08:28,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:08:28,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:08:28,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:08:28,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e1e818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28, skipping insertion in model container [2025-03-17 15:08:28,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:08:28,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:08:28,233 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:08:28,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:08:28,275 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:08:28,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28 WrapperNode [2025-03-17 15:08:28,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:08:28,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:08:28,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:08:28,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:08:28,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,318 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-03-17 15:08:28,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:08:28,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:08:28,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:08:28,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:08:28,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,345 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-17 15:08:28,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,352 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:08:28,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:08:28,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:08:28,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:08:28,363 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (1/1) ... [2025-03-17 15:08:28,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:08:28,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:28,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:08:28,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:08:28,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:08:28,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:08:28,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:08:28,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:08:28,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:08:28,405 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:08:28,439 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:08:28,440 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:08:28,973 INFO L? ?]: Removed 238 outVars from TransFormulas that were not future-live. [2025-03-17 15:08:28,973 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:08:28,987 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:08:28,987 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:08:28,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:08:28 BoogieIcfgContainer [2025-03-17 15:08:28,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:08:28,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:08:28,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:08:28,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:08:28,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:08:28" (1/3) ... [2025-03-17 15:08:28,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dd9fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:08:28, skipping insertion in model container [2025-03-17 15:08:28,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:28" (2/3) ... [2025-03-17 15:08:28,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dd9fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:08:28, skipping insertion in model container [2025-03-17 15:08:28,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:08:28" (3/3) ... [2025-03-17 15:08:28,996 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound2.c [2025-03-17 15:08:29,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:08:29,006 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_unwindbound2.c that has 2 procedures, 302 locations, 1 initial locations, 1 loop locations, and 140 error locations. [2025-03-17 15:08:29,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:08:29,051 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;@f8aa5fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:08:29,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 140 error locations. [2025-03-17 15:08:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 149 states have (on average 1.9664429530201342) internal successors, (293), 289 states have internal predecessors, (293), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 15:08:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 15:08:29,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:29,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 15:08:29,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:29,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:29,063 INFO L85 PathProgramCache]: Analyzing trace with hash 325640, now seen corresponding path program 1 times [2025-03-17 15:08:29,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:29,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646354031] [2025-03-17 15:08:29,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:29,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:29,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 15:08:29,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 15:08:29,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:29,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:08:29,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:29,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646354031] [2025-03-17 15:08:29,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646354031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:29,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:29,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:08:29,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68467663] [2025-03-17 15:08:29,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:29,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:08:29,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:29,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:08:29,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:08:29,237 INFO L87 Difference]: Start difference. First operand has 302 states, 149 states have (on average 1.9664429530201342) internal successors, (293), 289 states have internal predecessors, (293), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:08:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:29,323 INFO L93 Difference]: Finished difference Result 600 states and 648 transitions. [2025-03-17 15:08:29,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:08:29,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 15:08:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:29,330 INFO L225 Difference]: With dead ends: 600 [2025-03-17 15:08:29,331 INFO L226 Difference]: Without dead ends: 295 [2025-03-17 15:08:29,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-17 15:08:29,335 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 4 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 901 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-17 15:08:29,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 901 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:08:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-17 15:08:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-03-17 15:08:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 151 states have (on average 1.8874172185430464) internal successors, (285), 283 states have internal predecessors, (285), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:08:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 305 transitions. [2025-03-17 15:08:29,372 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 305 transitions. Word has length 3 [2025-03-17 15:08:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:29,373 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 305 transitions. [2025-03-17 15:08:29,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:08:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 305 transitions. [2025-03-17 15:08:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:08:29,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:29,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:08:29,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:08:29,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:29,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1111466748, now seen corresponding path program 1 times [2025-03-17 15:08:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:29,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256871696] [2025-03-17 15:08:29,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:29,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:29,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:08:29,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:08:29,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:29,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:08:29,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:29,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256871696] [2025-03-17 15:08:29,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256871696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:29,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:29,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:08:29,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584354821] [2025-03-17 15:08:29,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:29,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:08:29,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:29,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:08:29,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:29,418 INFO L87 Difference]: Start difference. First operand 295 states and 305 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:08:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:29,556 INFO L93 Difference]: Finished difference Result 563 states and 583 transitions. [2025-03-17 15:08:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:08:29,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 15:08:29,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:29,561 INFO L225 Difference]: With dead ends: 563 [2025-03-17 15:08:29,561 INFO L226 Difference]: Without dead ends: 543 [2025-03-17 15:08:29,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:29,562 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 237 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:29,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 699 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:08:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-17 15:08:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 353. [2025-03-17 15:08:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 204 states have (on average 1.7941176470588236) internal successors, (366), 336 states have internal predecessors, (366), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 15:08:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 396 transitions. [2025-03-17 15:08:29,587 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 396 transitions. Word has length 6 [2025-03-17 15:08:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:29,588 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 396 transitions. [2025-03-17 15:08:29,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:08:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 396 transitions. [2025-03-17 15:08:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 15:08:29,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:29,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 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-17 15:08:29,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:08:29,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:29,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash 262012332, now seen corresponding path program 1 times [2025-03-17 15:08:29,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:29,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292752496] [2025-03-17 15:08:29,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:29,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:29,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:08:29,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:08:29,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:29,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:29,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51518455] [2025-03-17 15:08:29,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:29,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:29,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:29,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:29,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:08:29,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:08:29,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:08:29,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:29,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:29,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:08:29,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:08:29,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:08:29,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:29,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292752496] [2025-03-17 15:08:29,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:08:29,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51518455] [2025-03-17 15:08:29,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51518455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:29,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:29,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:08:29,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692043008] [2025-03-17 15:08:29,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:29,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:08:29,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:29,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:08:29,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:29,800 INFO L87 Difference]: Start difference. First operand 353 states and 396 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:30,177 INFO L93 Difference]: Finished difference Result 513 states and 571 transitions. [2025-03-17 15:08:30,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:08:30,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-03-17 15:08:30,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:30,179 INFO L225 Difference]: With dead ends: 513 [2025-03-17 15:08:30,179 INFO L226 Difference]: Without dead ends: 458 [2025-03-17 15:08:30,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:30,180 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 134 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:30,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 361 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:08:30,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-17 15:08:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 438. [2025-03-17 15:08:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 284 states have (on average 1.6514084507042253) internal successors, (469), 416 states have internal predecessors, (469), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 15:08:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 509 transitions. [2025-03-17 15:08:30,192 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 509 transitions. Word has length 39 [2025-03-17 15:08:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:30,192 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 509 transitions. [2025-03-17 15:08:30,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 509 transitions. [2025-03-17 15:08:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 15:08:30,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:30,193 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:30,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 15:08:30,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:30,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:30,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1609212470, now seen corresponding path program 1 times [2025-03-17 15:08:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:30,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336178809] [2025-03-17 15:08:30,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:30,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:30,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 15:08:30,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 15:08:30,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:30,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:08:30,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:30,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336178809] [2025-03-17 15:08:30,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336178809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:30,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:30,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:08:30,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742531658] [2025-03-17 15:08:30,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:30,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:08:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:30,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:08:30,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:30,452 INFO L87 Difference]: Start difference. First operand 438 states and 509 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:30,671 INFO L93 Difference]: Finished difference Result 453 states and 516 transitions. [2025-03-17 15:08:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:08:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-03-17 15:08:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:30,673 INFO L225 Difference]: With dead ends: 453 [2025-03-17 15:08:30,674 INFO L226 Difference]: Without dead ends: 448 [2025-03-17 15:08:30,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:30,675 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 120 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:30,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 505 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:08:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-17 15:08:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 438. [2025-03-17 15:08:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 284 states have (on average 1.6338028169014085) internal successors, (464), 416 states have internal predecessors, (464), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 15:08:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 504 transitions. [2025-03-17 15:08:30,694 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 504 transitions. Word has length 41 [2025-03-17 15:08:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:30,694 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 504 transitions. [2025-03-17 15:08:30,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 504 transitions. [2025-03-17 15:08:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 15:08:30,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:30,695 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:30,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:08:30,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:30,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:30,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1654021195, now seen corresponding path program 1 times [2025-03-17 15:08:30,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:30,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141423176] [2025-03-17 15:08:30,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:30,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:08:30,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:08:30,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:30,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:08:30,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:30,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141423176] [2025-03-17 15:08:30,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141423176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:30,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:30,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:08:30,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431896591] [2025-03-17 15:08:30,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:30,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:08:30,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:30,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:08:30,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:30,784 INFO L87 Difference]: Start difference. First operand 438 states and 504 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:31,032 INFO L93 Difference]: Finished difference Result 453 states and 511 transitions. [2025-03-17 15:08:31,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:08:31,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-17 15:08:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:31,034 INFO L225 Difference]: With dead ends: 453 [2025-03-17 15:08:31,034 INFO L226 Difference]: Without dead ends: 448 [2025-03-17 15:08:31,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:31,035 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 119 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:31,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 547 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:08:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-17 15:08:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 438. [2025-03-17 15:08:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 284 states have (on average 1.6161971830985915) internal successors, (459), 416 states have internal predecessors, (459), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 15:08:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 499 transitions. [2025-03-17 15:08:31,045 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 499 transitions. Word has length 42 [2025-03-17 15:08:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:31,046 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 499 transitions. [2025-03-17 15:08:31,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 499 transitions. [2025-03-17 15:08:31,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 15:08:31,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:31,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:31,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:08:31,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:31,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:31,047 INFO L85 PathProgramCache]: Analyzing trace with hash -264950296, now seen corresponding path program 1 times [2025-03-17 15:08:31,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:31,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656090096] [2025-03-17 15:08:31,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:31,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:31,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 15:08:31,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 15:08:31,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:31,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:08:31,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:31,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656090096] [2025-03-17 15:08:31,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656090096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:31,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:31,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:08:31,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621342834] [2025-03-17 15:08:31,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:31,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:08:31,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:31,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:08:31,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:08:31,119 INFO L87 Difference]: Start difference. First operand 438 states and 499 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:31,880 INFO L93 Difference]: Finished difference Result 537 states and 660 transitions. [2025-03-17 15:08:31,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:08:31,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-03-17 15:08:31,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:31,883 INFO L225 Difference]: With dead ends: 537 [2025-03-17 15:08:31,883 INFO L226 Difference]: Without dead ends: 535 [2025-03-17 15:08:31,883 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-17 15:08:31,883 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 369 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:31,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 471 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 15:08:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-17 15:08:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 516. [2025-03-17 15:08:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 357 states have (on average 1.680672268907563) internal successors, (600), 489 states have internal predecessors, (600), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 15:08:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 650 transitions. [2025-03-17 15:08:31,895 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 650 transitions. Word has length 43 [2025-03-17 15:08:31,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:31,896 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 650 transitions. [2025-03-17 15:08:31,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 650 transitions. [2025-03-17 15:08:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 15:08:31,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:31,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:31,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:08:31,897 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:31,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash 376475625, now seen corresponding path program 1 times [2025-03-17 15:08:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410125936] [2025-03-17 15:08:31,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:31,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:08:31,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:08:31,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:31,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:08:31,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:31,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410125936] [2025-03-17 15:08:31,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410125936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:31,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:31,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:08:31,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472255893] [2025-03-17 15:08:31,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:31,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:08:31,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:31,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:08:31,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:08:31,982 INFO L87 Difference]: Start difference. First operand 516 states and 650 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:33,035 INFO L93 Difference]: Finished difference Result 538 states and 659 transitions. [2025-03-17 15:08:33,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:08:33,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-17 15:08:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:33,038 INFO L225 Difference]: With dead ends: 538 [2025-03-17 15:08:33,038 INFO L226 Difference]: Without dead ends: 536 [2025-03-17 15:08:33,038 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-17 15:08:33,039 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 368 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:33,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 408 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 15:08:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-17 15:08:33,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 517. [2025-03-17 15:08:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 358 states have (on average 1.6731843575418994) internal successors, (599), 490 states have internal predecessors, (599), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 15:08:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 649 transitions. [2025-03-17 15:08:33,051 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 649 transitions. Word has length 44 [2025-03-17 15:08:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:33,051 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 649 transitions. [2025-03-17 15:08:33,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 649 transitions. [2025-03-17 15:08:33,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 15:08:33,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:33,052 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:33,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:08:33,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:33,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1425940004, now seen corresponding path program 1 times [2025-03-17 15:08:33,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:33,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071518984] [2025-03-17 15:08:33,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:33,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:33,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 15:08:33,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 15:08:33,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:33,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:33,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594857443] [2025-03-17 15:08:33,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:33,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:33,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:33,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:33,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:08:33,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 15:08:33,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 15:08:33,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:33,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:33,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:08:33,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:08:33,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:08:33,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:33,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071518984] [2025-03-17 15:08:33,277 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:08:33,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594857443] [2025-03-17 15:08:33,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594857443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:33,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:33,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:08:33,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116657402] [2025-03-17 15:08:33,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:33,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:08:33,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:33,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:08:33,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:33,279 INFO L87 Difference]: Start difference. First operand 517 states and 649 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:33,605 INFO L93 Difference]: Finished difference Result 539 states and 656 transitions. [2025-03-17 15:08:33,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:08:33,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-17 15:08:33,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:33,611 INFO L225 Difference]: With dead ends: 539 [2025-03-17 15:08:33,611 INFO L226 Difference]: Without dead ends: 525 [2025-03-17 15:08:33,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:33,611 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 112 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:33,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 305 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:08:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-17 15:08:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 520. [2025-03-17 15:08:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 361 states have (on average 1.6371191135734071) internal successors, (591), 493 states have internal predecessors, (591), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 15:08:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 641 transitions. [2025-03-17 15:08:33,625 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 641 transitions. Word has length 47 [2025-03-17 15:08:33,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:33,625 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 641 transitions. [2025-03-17 15:08:33,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 641 transitions. [2025-03-17 15:08:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 15:08:33,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:33,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:33,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:08:33,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 15:08:33,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:33,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:33,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1254467365, now seen corresponding path program 1 times [2025-03-17 15:08:33,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:33,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015703566] [2025-03-17 15:08:33,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:33,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:33,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 15:08:33,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 15:08:33,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:33,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:08:33,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:33,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015703566] [2025-03-17 15:08:33,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015703566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:33,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:33,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:08:33,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748563968] [2025-03-17 15:08:33,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:33,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:08:33,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:33,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:08:33,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:08:33,906 INFO L87 Difference]: Start difference. First operand 520 states and 641 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:34,463 INFO L93 Difference]: Finished difference Result 529 states and 642 transitions. [2025-03-17 15:08:34,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:08:34,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-17 15:08:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:34,466 INFO L225 Difference]: With dead ends: 529 [2025-03-17 15:08:34,466 INFO L226 Difference]: Without dead ends: 527 [2025-03-17 15:08:34,466 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-17 15:08:34,466 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 255 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:34,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 402 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 15:08:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-17 15:08:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 520. [2025-03-17 15:08:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 361 states have (on average 1.631578947368421) internal successors, (589), 493 states have internal predecessors, (589), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 15:08:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 639 transitions. [2025-03-17 15:08:34,478 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 639 transitions. Word has length 48 [2025-03-17 15:08:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:34,479 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 639 transitions. [2025-03-17 15:08:34,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 639 transitions. [2025-03-17 15:08:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 15:08:34,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:34,479 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:34,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:08:34,479 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:34,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1811874207, now seen corresponding path program 1 times [2025-03-17 15:08:34,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:34,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563362753] [2025-03-17 15:08:34,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:34,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:34,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 15:08:34,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 15:08:34,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:34,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:08:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563362753] [2025-03-17 15:08:34,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563362753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:34,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:34,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:08:34,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122660567] [2025-03-17 15:08:34,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:34,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:08:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:34,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:08:34,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:08:34,552 INFO L87 Difference]: Start difference. First operand 520 states and 639 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:35,345 INFO L93 Difference]: Finished difference Result 543 states and 656 transitions. [2025-03-17 15:08:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:08:35,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-03-17 15:08:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:35,347 INFO L225 Difference]: With dead ends: 543 [2025-03-17 15:08:35,347 INFO L226 Difference]: Without dead ends: 508 [2025-03-17 15:08:35,348 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-17 15:08:35,348 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 358 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:35,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 357 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 15:08:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-17 15:08:35,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 496. [2025-03-17 15:08:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 341 states have (on average 1.6715542521994136) internal successors, (570), 471 states have internal predecessors, (570), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:08:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 616 transitions. [2025-03-17 15:08:35,365 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 616 transitions. Word has length 52 [2025-03-17 15:08:35,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:35,366 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 616 transitions. [2025-03-17 15:08:35,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:08:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 616 transitions. [2025-03-17 15:08:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 15:08:35,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:35,369 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:35,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:08:35,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:35,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:35,370 INFO L85 PathProgramCache]: Analyzing trace with hash 908046274, now seen corresponding path program 1 times [2025-03-17 15:08:35,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:35,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838218943] [2025-03-17 15:08:35,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:35,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:35,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 15:08:35,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 15:08:35,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:35,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:35,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:35,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838218943] [2025-03-17 15:08:35,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838218943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:35,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:35,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:08:35,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047603599] [2025-03-17 15:08:35,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:35,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:08:35,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:35,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:08:35,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:35,443 INFO L87 Difference]: Start difference. First operand 496 states and 616 transitions. Second operand has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:08:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:35,702 INFO L93 Difference]: Finished difference Result 503 states and 616 transitions. [2025-03-17 15:08:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:08:35,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 80 [2025-03-17 15:08:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:35,705 INFO L225 Difference]: With dead ends: 503 [2025-03-17 15:08:35,705 INFO L226 Difference]: Without dead ends: 502 [2025-03-17 15:08:35,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:35,706 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 63 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:35,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 425 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:08:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-17 15:08:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 496. [2025-03-17 15:08:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 341 states have (on average 1.6686217008797655) internal successors, (569), 471 states have internal predecessors, (569), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:08:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 615 transitions. [2025-03-17 15:08:35,722 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 615 transitions. Word has length 80 [2025-03-17 15:08:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:35,722 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 615 transitions. [2025-03-17 15:08:35,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:08:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 615 transitions. [2025-03-17 15:08:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 15:08:35,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:35,724 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:35,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 15:08:35,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:35,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:35,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1146759938, now seen corresponding path program 1 times [2025-03-17 15:08:35,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:35,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671483724] [2025-03-17 15:08:35,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:35,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:35,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 15:08:35,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 15:08:35,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:35,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:35,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:35,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671483724] [2025-03-17 15:08:35,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671483724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:35,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:35,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:08:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536211594] [2025-03-17 15:08:35,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:35,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:08:35,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:35,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:08:35,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:35,806 INFO L87 Difference]: Start difference. First operand 496 states and 615 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:08:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:36,012 INFO L93 Difference]: Finished difference Result 496 states and 615 transitions. [2025-03-17 15:08:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:08:36,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 84 [2025-03-17 15:08:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:36,014 INFO L225 Difference]: With dead ends: 496 [2025-03-17 15:08:36,014 INFO L226 Difference]: Without dead ends: 489 [2025-03-17 15:08:36,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:36,015 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:36,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 157 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:08:36,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-17 15:08:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-03-17 15:08:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 341 states have (on average 1.6363636363636365) internal successors, (558), 464 states have internal predecessors, (558), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:08:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2025-03-17 15:08:36,028 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 84 [2025-03-17 15:08:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:36,028 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2025-03-17 15:08:36,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:08:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2025-03-17 15:08:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 15:08:36,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:36,029 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:36,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:08:36,029 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1189819565, now seen corresponding path program 1 times [2025-03-17 15:08:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975642924] [2025-03-17 15:08:36,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:36,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 15:08:36,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:08:36,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:36,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975642924] [2025-03-17 15:08:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975642924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:36,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:36,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:08:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280050861] [2025-03-17 15:08:36,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:36,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:08:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:36,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:08:36,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:36,084 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:08:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:36,307 INFO L93 Difference]: Finished difference Result 498 states and 607 transitions. [2025-03-17 15:08:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:08:36,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-03-17 15:08:36,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:36,309 INFO L225 Difference]: With dead ends: 498 [2025-03-17 15:08:36,309 INFO L226 Difference]: Without dead ends: 497 [2025-03-17 15:08:36,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:36,310 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 62 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:36,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 441 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:08:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-17 15:08:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 491. [2025-03-17 15:08:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 343 states have (on average 1.6326530612244898) internal successors, (560), 466 states have internal predecessors, (560), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:08:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 606 transitions. [2025-03-17 15:08:36,339 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 606 transitions. Word has length 85 [2025-03-17 15:08:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:36,340 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 606 transitions. [2025-03-17 15:08:36,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:08:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 606 transitions. [2025-03-17 15:08:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 15:08:36,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:36,340 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:36,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 15:08:36,341 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:36,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash -959823115, now seen corresponding path program 1 times [2025-03-17 15:08:36,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:36,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474512058] [2025-03-17 15:08:36,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:36,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:36,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 15:08:36,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 15:08:36,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:36,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:08:36,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:36,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474512058] [2025-03-17 15:08:36,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474512058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:36,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:36,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:08:36,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480266081] [2025-03-17 15:08:36,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:36,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:08:36,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:36,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:08:36,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:36,399 INFO L87 Difference]: Start difference. First operand 491 states and 606 transitions. Second operand has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 15:08:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:36,463 INFO L93 Difference]: Finished difference Result 491 states and 606 transitions. [2025-03-17 15:08:36,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:08:36,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 87 [2025-03-17 15:08:36,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:36,465 INFO L225 Difference]: With dead ends: 491 [2025-03-17 15:08:36,465 INFO L226 Difference]: Without dead ends: 489 [2025-03-17 15:08:36,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:36,466 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 192 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:36,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 262 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:08:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-17 15:08:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-03-17 15:08:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 343 states have (on average 1.6151603498542273) internal successors, (554), 464 states have internal predecessors, (554), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:08:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 600 transitions. [2025-03-17 15:08:36,479 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 600 transitions. Word has length 87 [2025-03-17 15:08:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:36,479 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 600 transitions. [2025-03-17 15:08:36,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 15:08:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 600 transitions. [2025-03-17 15:08:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 15:08:36,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:36,480 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:36,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:08:36,480 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:36,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:36,481 INFO L85 PathProgramCache]: Analyzing trace with hash -955292719, now seen corresponding path program 1 times [2025-03-17 15:08:36,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:36,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655504213] [2025-03-17 15:08:36,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:36,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:36,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 15:08:36,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 15:08:36,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:36,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:36,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:36,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655504213] [2025-03-17 15:08:36,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655504213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:08:36,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388311617] [2025-03-17 15:08:36,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:36,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:36,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:36,573 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:36,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:08:36,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 15:08:36,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 15:08:36,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:36,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:36,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:08:36,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:36,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:08:36,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388311617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:36,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:08:36,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-17 15:08:36,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79394105] [2025-03-17 15:08:36,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:36,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:08:36,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:36,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:08:36,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:08:36,743 INFO L87 Difference]: Start difference. First operand 489 states and 600 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:08:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:36,765 INFO L93 Difference]: Finished difference Result 489 states and 600 transitions. [2025-03-17 15:08:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:08:36,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 87 [2025-03-17 15:08:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:36,766 INFO L225 Difference]: With dead ends: 489 [2025-03-17 15:08:36,767 INFO L226 Difference]: Without dead ends: 488 [2025-03-17 15:08:36,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 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-17 15:08:36,767 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 220 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:36,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 563 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:08:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-17 15:08:36,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-03-17 15:08:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 343 states have (on average 1.6122448979591837) internal successors, (553), 463 states have internal predecessors, (553), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:08:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 599 transitions. [2025-03-17 15:08:36,780 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 599 transitions. Word has length 87 [2025-03-17 15:08:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:36,780 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 599 transitions. [2025-03-17 15:08:36,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:08:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 599 transitions. [2025-03-17 15:08:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 15:08:36,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:36,781 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:36,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 15:08:36,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:36,982 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:36,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash 310254639, now seen corresponding path program 1 times [2025-03-17 15:08:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:36,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480818500] [2025-03-17 15:08:36,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:36,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:36,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 15:08:36,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 15:08:36,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:36,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:08:37,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:37,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480818500] [2025-03-17 15:08:37,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480818500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:37,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:37,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:08:37,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276283163] [2025-03-17 15:08:37,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:08:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:37,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:08:37,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:08:37,038 INFO L87 Difference]: Start difference. First operand 488 states and 599 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:08:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:37,195 INFO L93 Difference]: Finished difference Result 505 states and 599 transitions. [2025-03-17 15:08:37,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:08:37,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 88 [2025-03-17 15:08:37,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:37,197 INFO L225 Difference]: With dead ends: 505 [2025-03-17 15:08:37,197 INFO L226 Difference]: Without dead ends: 503 [2025-03-17 15:08:37,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:08:37,198 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 126 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:37,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 809 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:08:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-17 15:08:37,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 488. [2025-03-17 15:08:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 343 states have (on average 1.6064139941690962) internal successors, (551), 463 states have internal predecessors, (551), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:08:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 597 transitions. [2025-03-17 15:08:37,210 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 597 transitions. Word has length 88 [2025-03-17 15:08:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:37,211 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 597 transitions. [2025-03-17 15:08:37,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:08:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 597 transitions. [2025-03-17 15:08:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 15:08:37,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:37,212 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:37,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 15:08:37,212 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:37,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash 450697045, now seen corresponding path program 1 times [2025-03-17 15:08:37,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:37,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502257508] [2025-03-17 15:08:37,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:37,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 15:08:37,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 15:08:37,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:37,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:37,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:37,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502257508] [2025-03-17 15:08:37,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502257508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:08:37,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91374408] [2025-03-17 15:08:37,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:37,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:37,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:37,314 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:37,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:08:37,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 15:08:37,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 15:08:37,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:37,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:37,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:08:37,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:37,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:08:37,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91374408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:37,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:08:37,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-17 15:08:37,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760175718] [2025-03-17 15:08:37,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:37,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:08:37,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:37,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:08:37,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:08:37,455 INFO L87 Difference]: Start difference. First operand 488 states and 597 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:08:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:37,514 INFO L93 Difference]: Finished difference Result 565 states and 601 transitions. [2025-03-17 15:08:37,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:08:37,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 88 [2025-03-17 15:08:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:37,516 INFO L225 Difference]: With dead ends: 565 [2025-03-17 15:08:37,516 INFO L226 Difference]: Without dead ends: 564 [2025-03-17 15:08:37,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 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-17 15:08:37,518 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 214 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:37,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1471 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:08:37,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-17 15:08:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 491. [2025-03-17 15:08:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 346 states have (on average 1.5982658959537572) internal successors, (553), 465 states have internal predecessors, (553), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:08:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 599 transitions. [2025-03-17 15:08:37,533 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 599 transitions. Word has length 88 [2025-03-17 15:08:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:37,533 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 599 transitions. [2025-03-17 15:08:37,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:08:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 599 transitions. [2025-03-17 15:08:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 15:08:37,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:37,534 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:37,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 15:08:37,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 15:08:37,738 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:37,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:37,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1027959347, now seen corresponding path program 1 times [2025-03-17 15:08:37,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:37,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653796619] [2025-03-17 15:08:37,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:37,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 15:08:37,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 15:08:37,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:37,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:37,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784082151] [2025-03-17 15:08:37,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:37,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:37,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:37,755 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:37,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:08:37,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 15:08:37,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 15:08:37,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:37,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:37,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:08:37,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:08:37,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:08:37,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653796619] [2025-03-17 15:08:37,858 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:08:37,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784082151] [2025-03-17 15:08:37,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784082151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:37,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:37,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:08:37,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064997077] [2025-03-17 15:08:37,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:37,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:08:37,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:37,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:08:37,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:37,859 INFO L87 Difference]: Start difference. First operand 491 states and 599 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 15:08:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:37,986 INFO L93 Difference]: Finished difference Result 501 states and 599 transitions. [2025-03-17 15:08:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:08:37,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 89 [2025-03-17 15:08:37,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:37,988 INFO L225 Difference]: With dead ends: 501 [2025-03-17 15:08:37,988 INFO L226 Difference]: Without dead ends: 493 [2025-03-17 15:08:37,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:37,989 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 55 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:37,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 504 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:08:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-17 15:08:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2025-03-17 15:08:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 346 states have (on average 1.5751445086705202) internal successors, (545), 465 states have internal predecessors, (545), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:08:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 591 transitions. [2025-03-17 15:08:38,003 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 591 transitions. Word has length 89 [2025-03-17 15:08:38,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:38,003 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 591 transitions. [2025-03-17 15:08:38,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 15:08:38,003 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 591 transitions. [2025-03-17 15:08:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 15:08:38,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:38,004 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:38,010 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-17 15:08:38,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 15:08:38,209 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:38,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash -671828333, now seen corresponding path program 1 times [2025-03-17 15:08:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538118847] [2025-03-17 15:08:38,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:38,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:38,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 15:08:38,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 15:08:38,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:38,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:38,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:38,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538118847] [2025-03-17 15:08:38,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538118847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:08:38,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321789777] [2025-03-17 15:08:38,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:38,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:38,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:38,270 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:38,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:08:38,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 15:08:38,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 15:08:38,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:38,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:38,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:08:38,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:38,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:08:38,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321789777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:38,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:08:38,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-17 15:08:38,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217015572] [2025-03-17 15:08:38,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:38,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:08:38,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:38,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:08:38,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:08:38,377 INFO L87 Difference]: Start difference. First operand 491 states and 591 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:08:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:38,466 INFO L93 Difference]: Finished difference Result 498 states and 591 transitions. [2025-03-17 15:08:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:08:38,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 90 [2025-03-17 15:08:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:38,468 INFO L225 Difference]: With dead ends: 498 [2025-03-17 15:08:38,468 INFO L226 Difference]: Without dead ends: 490 [2025-03-17 15:08:38,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 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-17 15:08:38,469 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 295 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:38,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 412 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:08:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-17 15:08:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 483. [2025-03-17 15:08:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 346 states have (on average 1.546242774566474) internal successors, (535), 457 states have internal predecessors, (535), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:08:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 581 transitions. [2025-03-17 15:08:38,484 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 581 transitions. Word has length 90 [2025-03-17 15:08:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:38,484 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 581 transitions. [2025-03-17 15:08:38,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:08:38,484 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 581 transitions. [2025-03-17 15:08:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 15:08:38,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:38,485 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:38,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 15:08:38,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:38,686 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:38,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash 648158413, now seen corresponding path program 1 times [2025-03-17 15:08:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:38,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75202445] [2025-03-17 15:08:38,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:38,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 15:08:38,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 15:08:38,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:38,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:38,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75202445] [2025-03-17 15:08:38,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75202445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:08:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143289736] [2025-03-17 15:08:38,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:38,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:38,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:38,743 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:38,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:08:38,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 15:08:38,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 15:08:38,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:38,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:38,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:08:38,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:38,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:08:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:38,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143289736] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:08:38,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:08:38,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 15:08:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508199982] [2025-03-17 15:08:38,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:08:38,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:08:38,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:38,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:08:38,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:08:38,951 INFO L87 Difference]: Start difference. First operand 483 states and 581 transitions. Second operand has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 15:08:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:39,102 INFO L93 Difference]: Finished difference Result 844 states and 1034 transitions. [2025-03-17 15:08:39,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:08:39,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 91 [2025-03-17 15:08:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:39,105 INFO L225 Difference]: With dead ends: 844 [2025-03-17 15:08:39,105 INFO L226 Difference]: Without dead ends: 836 [2025-03-17 15:08:39,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 178 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-17 15:08:39,106 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 490 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:39,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1026 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:08:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-17 15:08:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 554. [2025-03-17 15:08:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 417 states have (on average 1.5227817745803358) internal successors, (635), 523 states have internal predecessors, (635), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 15:08:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 691 transitions. [2025-03-17 15:08:39,121 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 691 transitions. Word has length 91 [2025-03-17 15:08:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:39,122 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 691 transitions. [2025-03-17 15:08:39,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 15:08:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 691 transitions. [2025-03-17 15:08:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 15:08:39,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:39,122 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:39,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 15:08:39,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:39,323 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:39,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:39,324 INFO L85 PathProgramCache]: Analyzing trace with hash -429332231, now seen corresponding path program 1 times [2025-03-17 15:08:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:39,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215672710] [2025-03-17 15:08:39,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:39,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:39,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 15:08:39,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 15:08:39,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:39,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:39,411 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:08:39,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:39,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215672710] [2025-03-17 15:08:39,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215672710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:08:39,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678801033] [2025-03-17 15:08:39,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:39,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:39,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:39,414 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:39,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 15:08:39,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 15:08:39,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 15:08:39,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:39,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:39,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:08:39,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:08:39,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:08:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:08:39,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678801033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:08:39,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:08:39,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 9 [2025-03-17 15:08:39,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037314167] [2025-03-17 15:08:39,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:08:39,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:08:39,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:39,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:08:39,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:08:39,641 INFO L87 Difference]: Start difference. First operand 554 states and 691 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 15:08:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:39,707 INFO L93 Difference]: Finished difference Result 728 states and 860 transitions. [2025-03-17 15:08:39,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:08:39,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-03-17 15:08:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:39,709 INFO L225 Difference]: With dead ends: 728 [2025-03-17 15:08:39,709 INFO L226 Difference]: Without dead ends: 565 [2025-03-17 15:08:39,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:08:39,710 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 76 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:39,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1597 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:08:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-17 15:08:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 558. [2025-03-17 15:08:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 420 states have (on average 1.5166666666666666) internal successors, (637), 526 states have internal predecessors, (637), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 15:08:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 693 transitions. [2025-03-17 15:08:39,724 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 693 transitions. Word has length 100 [2025-03-17 15:08:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:39,724 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 693 transitions. [2025-03-17 15:08:39,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 15:08:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 693 transitions. [2025-03-17 15:08:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 15:08:39,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:39,725 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:39,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 15:08:39,926 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,SelfDestructingSolverStorable20 [2025-03-17 15:08:39,926 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:39,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash 315059820, now seen corresponding path program 1 times [2025-03-17 15:08:39,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:39,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326808204] [2025-03-17 15:08:39,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:39,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:39,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 15:08:39,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 15:08:39,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:39,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:39,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391279098] [2025-03-17 15:08:39,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:39,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:39,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:39,939 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:39,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 15:08:39,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 15:08:39,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 15:08:39,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:39,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:39,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:08:39,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:08:40,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:08:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:08:40,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:40,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326808204] [2025-03-17 15:08:40,181 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:08:40,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391279098] [2025-03-17 15:08:40,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391279098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:08:40,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:08:40,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-17 15:08:40,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271931404] [2025-03-17 15:08:40,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:08:40,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:08:40,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:40,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:08:40,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:08:40,182 INFO L87 Difference]: Start difference. First operand 558 states and 693 transitions. Second operand has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 15:08:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:40,362 INFO L93 Difference]: Finished difference Result 915 states and 1024 transitions. [2025-03-17 15:08:40,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:08:40,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 102 [2025-03-17 15:08:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:40,365 INFO L225 Difference]: With dead ends: 915 [2025-03-17 15:08:40,365 INFO L226 Difference]: Without dead ends: 909 [2025-03-17 15:08:40,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:08:40,369 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 858 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:40,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1276 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:08:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-03-17 15:08:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 558. [2025-03-17 15:08:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 424 states have (on average 1.490566037735849) internal successors, (632), 525 states have internal predecessors, (632), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 15:08:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 690 transitions. [2025-03-17 15:08:40,389 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 690 transitions. Word has length 102 [2025-03-17 15:08:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:40,389 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 690 transitions. [2025-03-17 15:08:40,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 15:08:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 690 transitions. [2025-03-17 15:08:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 15:08:40,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:40,390 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:40,397 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-17 15:08:40,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:40,595 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:40,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:40,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2093345583, now seen corresponding path program 1 times [2025-03-17 15:08:40,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:40,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516421392] [2025-03-17 15:08:40,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:40,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:40,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 15:08:40,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 15:08:40,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:40,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:40,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [69953654] [2025-03-17 15:08:40,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:40,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:40,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:40,612 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:40,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 15:08:40,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 15:08:40,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 15:08:40,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:40,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:40,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:08:40,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 15:08:40,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:08:40,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:40,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516421392] [2025-03-17 15:08:40,735 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:08:40,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69953654] [2025-03-17 15:08:40,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69953654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:40,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:40,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:08:40,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268432120] [2025-03-17 15:08:40,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:40,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:08:40,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:40,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:08:40,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:08:40,736 INFO L87 Difference]: Start difference. First operand 558 states and 690 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 15:08:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:41,042 INFO L93 Difference]: Finished difference Result 559 states and 690 transitions. [2025-03-17 15:08:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:08:41,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 104 [2025-03-17 15:08:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:41,045 INFO L225 Difference]: With dead ends: 559 [2025-03-17 15:08:41,045 INFO L226 Difference]: Without dead ends: 558 [2025-03-17 15:08:41,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 101 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-17 15:08:41,045 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 102 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:41,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 428 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:08:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-17 15:08:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2025-03-17 15:08:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 424 states have (on average 1.4882075471698113) internal successors, (631), 525 states have internal predecessors, (631), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 15:08:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 689 transitions. [2025-03-17 15:08:41,072 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 689 transitions. Word has length 104 [2025-03-17 15:08:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:41,072 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 689 transitions. [2025-03-17 15:08:41,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 15:08:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 689 transitions. [2025-03-17 15:08:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 15:08:41,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:41,073 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:41,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 15:08:41,273 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,SelfDestructingSolverStorable22 [2025-03-17 15:08:41,274 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:41,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:41,274 INFO L85 PathProgramCache]: Analyzing trace with hash 469203740, now seen corresponding path program 1 times [2025-03-17 15:08:41,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:41,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089944922] [2025-03-17 15:08:41,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:41,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:41,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 15:08:41,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 15:08:41,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:41,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:41,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495758605] [2025-03-17 15:08:41,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:41,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:41,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:41,288 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:41,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 15:08:41,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 15:08:41,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 15:08:41,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:41,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:41,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:08:41,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 15:08:41,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:08:41,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:41,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089944922] [2025-03-17 15:08:41,500 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:08:41,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495758605] [2025-03-17 15:08:41,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495758605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:41,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:41,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:08:41,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242541705] [2025-03-17 15:08:41,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:41,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:08:41,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:41,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:08:41,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:08:41,501 INFO L87 Difference]: Start difference. First operand 558 states and 689 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 15:08:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:41,847 INFO L93 Difference]: Finished difference Result 559 states and 689 transitions. [2025-03-17 15:08:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:08:41,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2025-03-17 15:08:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:41,849 INFO L225 Difference]: With dead ends: 559 [2025-03-17 15:08:41,849 INFO L226 Difference]: Without dead ends: 558 [2025-03-17 15:08:41,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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-17 15:08:41,849 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 96 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:41,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 356 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:08:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-17 15:08:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2025-03-17 15:08:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 424 states have (on average 1.4858490566037736) internal successors, (630), 525 states have internal predecessors, (630), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 15:08:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 688 transitions. [2025-03-17 15:08:41,871 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 688 transitions. Word has length 105 [2025-03-17 15:08:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:41,871 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 688 transitions. [2025-03-17 15:08:41,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 15:08:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 688 transitions. [2025-03-17 15:08:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 15:08:41,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:41,872 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:41,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 15:08:42,073 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,SelfDestructingSolverStorable23 [2025-03-17 15:08:42,073 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:42,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:42,073 INFO L85 PathProgramCache]: Analyzing trace with hash 768866549, now seen corresponding path program 1 times [2025-03-17 15:08:42,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:42,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588085391] [2025-03-17 15:08:42,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:42,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:42,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 15:08:42,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 15:08:42,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:42,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:42,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293959470] [2025-03-17 15:08:42,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:42,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:42,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:42,088 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:42,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 15:08:42,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 15:08:42,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 15:08:42,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:42,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:42,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:08:42,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:08:42,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:08:42,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:42,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588085391] [2025-03-17 15:08:42,342 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:08:42,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293959470] [2025-03-17 15:08:42,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293959470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:42,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:42,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:08:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696574918] [2025-03-17 15:08:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:42,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:08:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:42,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:08:42,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:08:42,343 INFO L87 Difference]: Start difference. First operand 558 states and 688 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:08:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:42,747 INFO L93 Difference]: Finished difference Result 558 states and 688 transitions. [2025-03-17 15:08:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:08:42,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 123 [2025-03-17 15:08:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:42,749 INFO L225 Difference]: With dead ends: 558 [2025-03-17 15:08:42,749 INFO L226 Difference]: Without dead ends: 548 [2025-03-17 15:08:42,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:08:42,750 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 235 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:42,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 319 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:08:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-17 15:08:42,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-17 15:08:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 424 states have (on average 1.4386792452830188) internal successors, (610), 515 states have internal predecessors, (610), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 15:08:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 668 transitions. [2025-03-17 15:08:42,772 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 668 transitions. Word has length 123 [2025-03-17 15:08:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:42,773 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 668 transitions. [2025-03-17 15:08:42,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:08:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 668 transitions. [2025-03-17 15:08:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 15:08:42,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:42,774 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:42,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 15:08:42,975 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,SelfDestructingSolverStorable24 [2025-03-17 15:08:42,975 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:42,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:42,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1934940540, now seen corresponding path program 1 times [2025-03-17 15:08:42,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:42,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589560708] [2025-03-17 15:08:42,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:42,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:42,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 15:08:42,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 15:08:42,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:42,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:42,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058074638] [2025-03-17 15:08:42,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:42,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:42,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:42,995 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:08:42,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 15:08:43,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 15:08:43,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 15:08:43,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:43,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:43,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:08:43,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:08:43,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:08:43,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:43,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589560708] [2025-03-17 15:08:43,642 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:08:43,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058074638] [2025-03-17 15:08:43,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058074638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:08:43,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:08:43,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-17 15:08:43,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077625985] [2025-03-17 15:08:43,643 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:08:43,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:08:43,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:43,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:08:43,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:08:43,645 INFO L87 Difference]: Start difference. First operand 548 states and 668 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:08:44,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:44,296 INFO L93 Difference]: Finished difference Result 673 states and 822 transitions. [2025-03-17 15:08:44,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:08:44,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2025-03-17 15:08:44,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:44,300 INFO L225 Difference]: With dead ends: 673 [2025-03-17 15:08:44,300 INFO L226 Difference]: Without dead ends: 650 [2025-03-17 15:08:44,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:08:44,302 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 186 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:44,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 599 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 15:08:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-17 15:08:44,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 633. [2025-03-17 15:08:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 504 states have (on average 1.4424603174603174) internal successors, (727), 595 states have internal predecessors, (727), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 15:08:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 795 transitions. [2025-03-17 15:08:44,321 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 795 transitions. Word has length 124 [2025-03-17 15:08:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:44,322 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 795 transitions. [2025-03-17 15:08:44,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:08:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 795 transitions. [2025-03-17 15:08:44,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 15:08:44,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:44,323 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:44,330 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-17 15:08:44,528 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,SelfDestructingSolverStorable25 [2025-03-17 15:08:44,528 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:44,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash 146385619, now seen corresponding path program 1 times [2025-03-17 15:08:44,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:44,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425557220] [2025-03-17 15:08:44,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:44,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:44,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 15:08:44,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 15:08:44,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:44,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:08:44,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425557220] [2025-03-17 15:08:44,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425557220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:08:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046506030] [2025-03-17 15:08:44,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:44,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:44,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:44,586 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-17 15:08:44,587 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-17 15:08:44,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 15:08:44,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 15:08:44,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:44,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:44,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:08:44,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:08:44,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:08:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:08:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046506030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:08:44,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:08:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 15:08:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563270590] [2025-03-17 15:08:44,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:08:44,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:08:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:44,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:08:44,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:08:44,911 INFO L87 Difference]: Start difference. First operand 633 states and 795 transitions. Second operand has 7 states, 6 states have (on average 38.166666666666664) internal successors, (229), 7 states have internal predecessors, (229), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-17 15:08:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:45,616 INFO L93 Difference]: Finished difference Result 676 states and 799 transitions. [2025-03-17 15:08:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:08:45,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 38.166666666666664) internal successors, (229), 7 states have internal predecessors, (229), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 125 [2025-03-17 15:08:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:45,619 INFO L225 Difference]: With dead ends: 676 [2025-03-17 15:08:45,619 INFO L226 Difference]: Without dead ends: 671 [2025-03-17 15:08:45,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:08:45,619 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 446 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:45,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 775 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 15:08:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-17 15:08:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 632. [2025-03-17 15:08:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 504 states have (on average 1.4226190476190477) internal successors, (717), 594 states have internal predecessors, (717), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 15:08:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 785 transitions. [2025-03-17 15:08:45,636 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 785 transitions. Word has length 125 [2025-03-17 15:08:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:45,636 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 785 transitions. [2025-03-17 15:08:45,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 38.166666666666664) internal successors, (229), 7 states have internal predecessors, (229), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-17 15:08:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 785 transitions. [2025-03-17 15:08:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 15:08:45,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:45,637 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:45,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 15:08:45,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:45,838 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:45,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash 242987106, now seen corresponding path program 1 times [2025-03-17 15:08:45,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:45,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880669261] [2025-03-17 15:08:45,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:45,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:45,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 15:08:45,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 15:08:45,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:45,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:45,902 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:08:45,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880669261] [2025-03-17 15:08:45,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880669261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:08:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364849085] [2025-03-17 15:08:45,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:45,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:45,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:45,904 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-17 15:08:45,905 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-17 15:08:45,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 15:08:45,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 15:08:45,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:45,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:45,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:08:45,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:08:46,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:08:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:08:46,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364849085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:08:46,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:08:46,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 15:08:46,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318687965] [2025-03-17 15:08:46,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:08:46,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:08:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:46,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:08:46,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:08:46,216 INFO L87 Difference]: Start difference. First operand 632 states and 785 transitions. Second operand has 7 states, 6 states have (on average 38.5) internal successors, (231), 7 states have internal predecessors, (231), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-17 15:08:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:46,669 INFO L93 Difference]: Finished difference Result 675 states and 789 transitions. [2025-03-17 15:08:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:08:46,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 38.5) internal successors, (231), 7 states have internal predecessors, (231), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 126 [2025-03-17 15:08:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:46,671 INFO L225 Difference]: With dead ends: 675 [2025-03-17 15:08:46,671 INFO L226 Difference]: Without dead ends: 670 [2025-03-17 15:08:46,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:08:46,671 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 644 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:46,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 509 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:08:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-03-17 15:08:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 631. [2025-03-17 15:08:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 504 states have (on average 1.4027777777777777) internal successors, (707), 593 states have internal predecessors, (707), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 15:08:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 775 transitions. [2025-03-17 15:08:46,687 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 775 transitions. Word has length 126 [2025-03-17 15:08:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:46,688 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 775 transitions. [2025-03-17 15:08:46,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 38.5) internal successors, (231), 7 states have internal predecessors, (231), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-17 15:08:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 775 transitions. [2025-03-17 15:08:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 15:08:46,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:46,689 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-17 15:08:46,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-17 15:08:46,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 15:08:46,890 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:46,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1057334095, now seen corresponding path program 1 times [2025-03-17 15:08:46,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:46,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062740205] [2025-03-17 15:08:46,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:46,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:46,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 15:08:46,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 15:08:46,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:46,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:46,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001117950] [2025-03-17 15:08:46,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:46,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:46,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:46,908 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-17 15:08:46,909 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-17 15:08:46,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 15:08:46,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 15:08:46,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:46,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:46,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 15:08:46,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:08:47,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:08:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:08:47,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:47,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062740205] [2025-03-17 15:08:47,490 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:08:47,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001117950] [2025-03-17 15:08:47,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001117950] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:08:47,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:08:47,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-17 15:08:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012308354] [2025-03-17 15:08:47,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:08:47,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:08:47,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:47,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:08:47,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:08:47,492 INFO L87 Difference]: Start difference. First operand 631 states and 775 transitions. Second operand has 10 states, 9 states have (on average 19.666666666666668) internal successors, (177), 10 states have internal predecessors, (177), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 15:08:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:50,012 INFO L93 Difference]: Finished difference Result 677 states and 780 transitions. [2025-03-17 15:08:50,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:08:50,013 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 19.666666666666668) internal successors, (177), 10 states have internal predecessors, (177), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 127 [2025-03-17 15:08:50,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:50,015 INFO L225 Difference]: With dead ends: 677 [2025-03-17 15:08:50,015 INFO L226 Difference]: Without dead ends: 528 [2025-03-17 15:08:50,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:08:50,016 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 542 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:50,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 584 Invalid, 2265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 15:08:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-17 15:08:50,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 519. [2025-03-17 15:08:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 400 states have (on average 1.405) internal successors, (562), 487 states have internal predecessors, (562), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 15:08:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 618 transitions. [2025-03-17 15:08:50,029 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 618 transitions. Word has length 127 [2025-03-17 15:08:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:50,031 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 618 transitions. [2025-03-17 15:08:50,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 19.666666666666668) internal successors, (177), 10 states have internal predecessors, (177), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 15:08:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 618 transitions. [2025-03-17 15:08:50,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 15:08:50,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:50,033 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 15:08:50,039 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-17 15:08:50,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 15:08:50,237 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:50,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:50,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2048889124, now seen corresponding path program 1 times [2025-03-17 15:08:50,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:50,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804362246] [2025-03-17 15:08:50,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:50,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:50,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 15:08:50,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 15:08:50,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:50,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-03-17 15:08:50,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:50,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804362246] [2025-03-17 15:08:50,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804362246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:08:50,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:08:50,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:08:50,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457638967] [2025-03-17 15:08:50,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:08:50,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:08:50,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:50,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:08:50,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:50,288 INFO L87 Difference]: Start difference. First operand 519 states and 618 transitions. Second operand has 3 states, 2 states have (on average 44.5) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 15:08:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:50,536 INFO L93 Difference]: Finished difference Result 525 states and 618 transitions. [2025-03-17 15:08:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:08:50,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 44.5) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 169 [2025-03-17 15:08:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:50,538 INFO L225 Difference]: With dead ends: 525 [2025-03-17 15:08:50,538 INFO L226 Difference]: Without dead ends: 522 [2025-03-17 15:08:50,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:08:50,538 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 132 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:50,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 235 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:08:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-17 15:08:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 517. [2025-03-17 15:08:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 400 states have (on average 1.3925) internal successors, (557), 485 states have internal predecessors, (557), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 15:08:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 613 transitions. [2025-03-17 15:08:50,552 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 613 transitions. Word has length 169 [2025-03-17 15:08:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:50,552 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 613 transitions. [2025-03-17 15:08:50,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 44.5) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 15:08:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 613 transitions. [2025-03-17 15:08:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 15:08:50,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:50,553 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:08:50,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 15:08:50,553 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:50,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1479139334, now seen corresponding path program 1 times [2025-03-17 15:08:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:50,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113985441] [2025-03-17 15:08:50,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:50,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:50,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 15:08:50,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 15:08:50,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:50,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:08:50,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:50,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113985441] [2025-03-17 15:08:50,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113985441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:08:50,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556449405] [2025-03-17 15:08:50,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:50,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:50,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:50,630 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-17 15:08:50,632 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-17 15:08:50,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 15:08:50,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 15:08:50,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:50,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:50,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:08:50,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:08:50,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:08:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:08:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556449405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:08:50,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:08:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 15:08:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313034486] [2025-03-17 15:08:50,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:08:50,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:08:50,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:50,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:08:50,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:08:50,941 INFO L87 Difference]: Start difference. First operand 517 states and 613 transitions. Second operand has 9 states, 8 states have (on average 36.375) internal successors, (291), 9 states have internal predecessors, (291), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-17 15:08:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:51,275 INFO L93 Difference]: Finished difference Result 687 states and 775 transitions. [2025-03-17 15:08:51,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:08:51,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 36.375) internal successors, (291), 9 states have internal predecessors, (291), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) Word has length 172 [2025-03-17 15:08:51,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:51,277 INFO L225 Difference]: With dead ends: 687 [2025-03-17 15:08:51,277 INFO L226 Difference]: Without dead ends: 685 [2025-03-17 15:08:51,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:08:51,278 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 862 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:51,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1028 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:08:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-17 15:08:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 515. [2025-03-17 15:08:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 400 states have (on average 1.3775) internal successors, (551), 483 states have internal predecessors, (551), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 15:08:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 607 transitions. [2025-03-17 15:08:51,291 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 607 transitions. Word has length 172 [2025-03-17 15:08:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:51,291 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 607 transitions. [2025-03-17 15:08:51,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 36.375) internal successors, (291), 9 states have internal predecessors, (291), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-17 15:08:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 607 transitions. [2025-03-17 15:08:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 15:08:51,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:51,292 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:08:51,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-17 15:08:51,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:51,493 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:51,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:51,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1391320772, now seen corresponding path program 1 times [2025-03-17 15:08:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:51,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950801314] [2025-03-17 15:08:51,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:51,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:51,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 15:08:51,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 15:08:51,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:51,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:51,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142152798] [2025-03-17 15:08:51,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:51,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:51,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:51,516 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-17 15:08:51,517 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-17 15:08:51,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 15:08:51,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 15:08:51,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:51,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:51,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:08:51,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:08:51,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:08:52,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:52,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950801314] [2025-03-17 15:08:52,411 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:08:52,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142152798] [2025-03-17 15:08:52,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142152798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:08:52,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:08:52,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-17 15:08:52,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485113514] [2025-03-17 15:08:52,411 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:08:52,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:08:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:52,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:08:52,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:08:52,412 INFO L87 Difference]: Start difference. First operand 515 states and 607 transitions. Second operand has 5 states, 4 states have (on average 30.25) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 15:08:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:52,848 INFO L93 Difference]: Finished difference Result 516 states and 607 transitions. [2025-03-17 15:08:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:08:52,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 30.25) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 173 [2025-03-17 15:08:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:52,850 INFO L225 Difference]: With dead ends: 516 [2025-03-17 15:08:52,850 INFO L226 Difference]: Without dead ends: 515 [2025-03-17 15:08:52,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:08:52,851 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 32 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:52,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 527 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:08:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-17 15:08:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-03-17 15:08:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 400 states have (on average 1.375) internal successors, (550), 483 states have internal predecessors, (550), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 15:08:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 606 transitions. [2025-03-17 15:08:52,869 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 606 transitions. Word has length 173 [2025-03-17 15:08:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:52,870 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 606 transitions. [2025-03-17 15:08:52,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 30.25) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 15:08:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 606 transitions. [2025-03-17 15:08:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 15:08:52,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:52,870 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:08:52,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-17 15:08:53,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:53,071 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:53,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:53,071 INFO L85 PathProgramCache]: Analyzing trace with hash -181270844, now seen corresponding path program 1 times [2025-03-17 15:08:53,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:53,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883758722] [2025-03-17 15:08:53,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:53,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:53,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 15:08:53,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 15:08:53,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:53,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:53,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735045239] [2025-03-17 15:08:53,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:53,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:53,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:53,095 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-17 15:08:53,096 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-17 15:08:53,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 15:08:53,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 15:08:53,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:53,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:53,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:08:53,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:08:53,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:08:53,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:53,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883758722] [2025-03-17 15:08:53,589 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:08:53,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735045239] [2025-03-17 15:08:53,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735045239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:08:53,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:08:53,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-17 15:08:53,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376308798] [2025-03-17 15:08:53,589 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:08:53,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:08:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:53,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:08:53,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:08:53,590 INFO L87 Difference]: Start difference. First operand 515 states and 606 transitions. Second operand has 6 states, 5 states have (on average 24.4) internal successors, (122), 6 states have internal predecessors, (122), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 15:08:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:54,006 INFO L93 Difference]: Finished difference Result 526 states and 606 transitions. [2025-03-17 15:08:54,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:08:54,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 24.4) internal successors, (122), 6 states have internal predecessors, (122), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 174 [2025-03-17 15:08:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:54,007 INFO L225 Difference]: With dead ends: 526 [2025-03-17 15:08:54,007 INFO L226 Difference]: Without dead ends: 525 [2025-03-17 15:08:54,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:08:54,008 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 69 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:54,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 632 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:08:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-17 15:08:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 515. [2025-03-17 15:08:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 400 states have (on average 1.3725) internal successors, (549), 483 states have internal predecessors, (549), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 15:08:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 605 transitions. [2025-03-17 15:08:54,020 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 605 transitions. Word has length 174 [2025-03-17 15:08:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:54,020 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 605 transitions. [2025-03-17 15:08:54,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.4) internal successors, (122), 6 states have internal predecessors, (122), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 15:08:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 605 transitions. [2025-03-17 15:08:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 15:08:54,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:54,021 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:08:54,027 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-17 15:08:54,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:54,222 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:54,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1465697480, now seen corresponding path program 1 times [2025-03-17 15:08:54,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:54,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001887956] [2025-03-17 15:08:54,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:54,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 15:08:54,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 15:08:54,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:54,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:54,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1776553635] [2025-03-17 15:08:54,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:54,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:54,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:54,245 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-17 15:08:54,246 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-17 15:08:54,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 15:08:54,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 15:08:54,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:54,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:54,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:08:54,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:08:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:08:54,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:08:59,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:08:59,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001887956] [2025-03-17 15:08:59,003 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:08:59,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776553635] [2025-03-17 15:08:59,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776553635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:08:59,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:08:59,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-17 15:08:59,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458624832] [2025-03-17 15:08:59,003 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:08:59,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:08:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:08:59,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:08:59,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=62, Unknown=1, NotChecked=0, Total=90 [2025-03-17 15:08:59,004 INFO L87 Difference]: Start difference. First operand 515 states and 605 transitions. Second operand has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 15:08:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:08:59,571 INFO L93 Difference]: Finished difference Result 519 states and 605 transitions. [2025-03-17 15:08:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:08:59,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 177 [2025-03-17 15:08:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:08:59,573 INFO L225 Difference]: With dead ends: 519 [2025-03-17 15:08:59,573 INFO L226 Difference]: Without dead ends: 515 [2025-03-17 15:08:59,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=35, Invalid=74, Unknown=1, NotChecked=0, Total=110 [2025-03-17 15:08:59,573 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 27 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 15:08:59,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 470 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 15:08:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-17 15:08:59,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-03-17 15:08:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 400 states have (on average 1.3625) internal successors, (545), 483 states have internal predecessors, (545), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 15:08:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 601 transitions. [2025-03-17 15:08:59,588 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 601 transitions. Word has length 177 [2025-03-17 15:08:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:08:59,588 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 601 transitions. [2025-03-17 15:08:59,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 15:08:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 601 transitions. [2025-03-17 15:08:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 15:08:59,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:08:59,589 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:08:59,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-17 15:08:59,792 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,SelfDestructingSolverStorable33 [2025-03-17 15:08:59,792 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:08:59,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:08:59,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1808018496, now seen corresponding path program 1 times [2025-03-17 15:08:59,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:08:59,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924404637] [2025-03-17 15:08:59,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:59,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:08:59,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 15:08:59,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 15:08:59,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:59,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:08:59,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1965413435] [2025-03-17 15:08:59,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:08:59,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:08:59,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:08:59,809 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-17 15:08:59,810 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-17 15:08:59,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 15:08:59,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 15:08:59,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:08:59,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:08:59,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 15:08:59,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:09:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:09:00,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:09:00,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:09:00,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924404637] [2025-03-17 15:09:00,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:09:00,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965413435] [2025-03-17 15:09:00,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965413435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:09:00,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:09:00,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-17 15:09:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705006220] [2025-03-17 15:09:00,241 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:09:00,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:09:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:09:00,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:09:00,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:09:00,241 INFO L87 Difference]: Start difference. First operand 515 states and 601 transitions. Second operand has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 15:09:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:09:00,629 INFO L93 Difference]: Finished difference Result 519 states and 601 transitions. [2025-03-17 15:09:00,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:09:00,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 178 [2025-03-17 15:09:00,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:09:00,631 INFO L225 Difference]: With dead ends: 519 [2025-03-17 15:09:00,631 INFO L226 Difference]: Without dead ends: 515 [2025-03-17 15:09:00,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:09:00,631 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 24 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:09:00,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 624 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:09:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-17 15:09:00,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-03-17 15:09:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 400 states have (on average 1.3525) internal successors, (541), 483 states have internal predecessors, (541), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 15:09:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 597 transitions. [2025-03-17 15:09:00,643 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 597 transitions. Word has length 178 [2025-03-17 15:09:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:09:00,643 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 597 transitions. [2025-03-17 15:09:00,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 15:09:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 597 transitions. [2025-03-17 15:09:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 15:09:00,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:09:00,644 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2025-03-17 15:09:00,650 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-17 15:09:00,844 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,SelfDestructingSolverStorable34 [2025-03-17 15:09:00,844 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:09:00,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:09:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash 281126962, now seen corresponding path program 1 times [2025-03-17 15:09:00,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:09:00,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940404454] [2025-03-17 15:09:00,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:00,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:09:00,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 15:09:00,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 15:09:00,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:00,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:09:00,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839532382] [2025-03-17 15:09:00,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:00,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:09:00,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:09:00,863 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:09:00,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 15:09:00,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 15:09:00,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 15:09:00,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:00,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:09:00,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 15:09:00,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:09:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:09:01,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:09:02,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:09:02,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940404454] [2025-03-17 15:09:02,097 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:09:02,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839532382] [2025-03-17 15:09:02,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839532382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:09:02,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:09:02,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-17 15:09:02,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622294572] [2025-03-17 15:09:02,098 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:09:02,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:09:02,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:09:02,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:09:02,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:09:02,098 INFO L87 Difference]: Start difference. First operand 515 states and 597 transitions. Second operand has 7 states, 6 states have (on average 22.166666666666668) internal successors, (133), 7 states have internal predecessors, (133), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 15:09:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:09:02,865 INFO L93 Difference]: Finished difference Result 515 states and 597 transitions. [2025-03-17 15:09:02,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:09:02,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 22.166666666666668) internal successors, (133), 7 states have internal predecessors, (133), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 185 [2025-03-17 15:09:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:09:02,867 INFO L225 Difference]: With dead ends: 515 [2025-03-17 15:09:02,867 INFO L226 Difference]: Without dead ends: 505 [2025-03-17 15:09:02,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:09:02,868 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 561 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:09:02,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 179 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 15:09:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-17 15:09:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-03-17 15:09:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 400 states have (on average 1.315) internal successors, (526), 473 states have internal predecessors, (526), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 15:09:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 582 transitions. [2025-03-17 15:09:02,888 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 582 transitions. Word has length 185 [2025-03-17 15:09:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:09:02,888 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 582 transitions. [2025-03-17 15:09:02,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 22.166666666666668) internal successors, (133), 7 states have internal predecessors, (133), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 15:09:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 582 transitions. [2025-03-17 15:09:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 15:09:02,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:09:02,889 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-17 15:09:02,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-17 15:09:03,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:09:03,090 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:09:03,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:09:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash 125001358, now seen corresponding path program 1 times [2025-03-17 15:09:03,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:09:03,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82131163] [2025-03-17 15:09:03,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:09:03,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 15:09:03,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 15:09:03,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:03,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:09:03,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316041040] [2025-03-17 15:09:03,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:03,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:09:03,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:09:03,107 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:09:03,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 15:09:03,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 15:09:03,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 15:09:03,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:03,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:09:03,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 15:09:03,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:09:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:09:04,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:09:04,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:09:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82131163] [2025-03-17 15:09:04,564 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:09:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316041040] [2025-03-17 15:09:04,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316041040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:09:04,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:09:04,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-17 15:09:04,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555175936] [2025-03-17 15:09:04,564 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:09:04,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:09:04,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:09:04,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:09:04,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:09:04,565 INFO L87 Difference]: Start difference. First operand 505 states and 582 transitions. Second operand has 9 states, 8 states have (on average 16.75) internal successors, (134), 9 states have internal predecessors, (134), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 15:09:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:09:05,552 INFO L93 Difference]: Finished difference Result 758 states and 930 transitions. [2025-03-17 15:09:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:09:05,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 16.75) internal successors, (134), 9 states have internal predecessors, (134), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 186 [2025-03-17 15:09:05,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:09:05,554 INFO L225 Difference]: With dead ends: 758 [2025-03-17 15:09:05,554 INFO L226 Difference]: Without dead ends: 753 [2025-03-17 15:09:05,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:09:05,555 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 192 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 15:09:05,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 593 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 15:09:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-03-17 15:09:05,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 600. [2025-03-17 15:09:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 487 states have (on average 1.3408624229979467) internal successors, (653), 560 states have internal predecessors, (653), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 15:09:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 725 transitions. [2025-03-17 15:09:05,574 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 725 transitions. Word has length 186 [2025-03-17 15:09:05,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:09:05,574 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 725 transitions. [2025-03-17 15:09:05,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 16.75) internal successors, (134), 9 states have internal predecessors, (134), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 15:09:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 725 transitions. [2025-03-17 15:09:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 15:09:05,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:09:05,575 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-03-17 15:09:05,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-17 15:09:05,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:09:05,780 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:09:05,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:09:05,780 INFO L85 PathProgramCache]: Analyzing trace with hash -132775220, now seen corresponding path program 1 times [2025-03-17 15:09:05,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:09:05,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909478570] [2025-03-17 15:09:05,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:05,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:09:05,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 15:09:05,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 15:09:05,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:05,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:09:05,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63835044] [2025-03-17 15:09:05,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:05,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:09:05,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:09:05,799 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:09:05,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 15:09:05,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 15:09:05,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 15:09:05,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:05,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:09:05,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 15:09:05,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:09:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:09:06,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:09:06,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:09:06,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909478570] [2025-03-17 15:09:06,534 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:09:06,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63835044] [2025-03-17 15:09:06,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63835044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:09:06,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:09:06,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-17 15:09:06,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563936400] [2025-03-17 15:09:06,534 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:09:06,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:09:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:09:06,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:09:06,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:09:06,535 INFO L87 Difference]: Start difference. First operand 600 states and 725 transitions. Second operand has 9 states, 8 states have (on average 17.0) internal successors, (136), 9 states have internal predecessors, (136), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 15:09:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:09:07,243 INFO L93 Difference]: Finished difference Result 746 states and 924 transitions. [2025-03-17 15:09:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:09:07,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 17.0) internal successors, (136), 9 states have internal predecessors, (136), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 188 [2025-03-17 15:09:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:09:07,245 INFO L225 Difference]: With dead ends: 746 [2025-03-17 15:09:07,245 INFO L226 Difference]: Without dead ends: 732 [2025-03-17 15:09:07,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:09:07,246 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 166 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:09:07,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 748 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 15:09:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-17 15:09:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 680. [2025-03-17 15:09:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 563 states have (on average 1.3392539964476022) internal successors, (754), 636 states have internal predecessors, (754), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 15:09:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 834 transitions. [2025-03-17 15:09:07,266 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 834 transitions. Word has length 188 [2025-03-17 15:09:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:09:07,266 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 834 transitions. [2025-03-17 15:09:07,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 17.0) internal successors, (136), 9 states have internal predecessors, (136), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 15:09:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 834 transitions. [2025-03-17 15:09:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 15:09:07,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:09:07,268 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:09:07,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-17 15:09:07,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-17 15:09:07,472 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:09:07,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:09:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash 178935598, now seen corresponding path program 1 times [2025-03-17 15:09:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:09:07,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087113749] [2025-03-17 15:09:07,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:07,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:09:07,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 15:09:07,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 15:09:07,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:07,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:09:07,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [751617995] [2025-03-17 15:09:07,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:07,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:09:07,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:09:07,493 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:09:07,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-17 15:09:07,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 15:09:07,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 15:09:07,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:07,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:09:07,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 15:09:07,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:09:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:09:08,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:09:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:09:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:09:09,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087113749] [2025-03-17 15:09:09,751 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:09:09,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751617995] [2025-03-17 15:09:09,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751617995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:09:09,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:09:09,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-17 15:09:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176028443] [2025-03-17 15:09:09,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:09:09,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 15:09:09,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:09:09,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 15:09:09,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:09:09,752 INFO L87 Difference]: Start difference. First operand 680 states and 834 transitions. Second operand has 18 states, 17 states have (on average 15.941176470588236) internal successors, (271), 18 states have internal predecessors, (271), 6 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-17 15:09:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:09:23,011 INFO L93 Difference]: Finished difference Result 837 states and 1027 transitions. [2025-03-17 15:09:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 15:09:23,012 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 15.941176470588236) internal successors, (271), 18 states have internal predecessors, (271), 6 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 189 [2025-03-17 15:09:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:09:23,014 INFO L225 Difference]: With dead ends: 837 [2025-03-17 15:09:23,014 INFO L226 Difference]: Without dead ends: 791 [2025-03-17 15:09:23,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2025-03-17 15:09:23,014 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1425 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 4073 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 4191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 4073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-03-17 15:09:23,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 487 Invalid, 4191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 4073 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2025-03-17 15:09:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-03-17 15:09:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 734. [2025-03-17 15:09:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 612 states have (on average 1.3300653594771241) internal successors, (814), 685 states have internal predecessors, (814), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 15:09:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 904 transitions. [2025-03-17 15:09:23,037 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 904 transitions. Word has length 189 [2025-03-17 15:09:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:09:23,037 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 904 transitions. [2025-03-17 15:09:23,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 15.941176470588236) internal successors, (271), 18 states have internal predecessors, (271), 6 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-17 15:09:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 904 transitions. [2025-03-17 15:09:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 15:09:23,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:09:23,038 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2025-03-17 15:09:23,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-17 15:09:23,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-17 15:09:23,239 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:09:23,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:09:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash 973308822, now seen corresponding path program 1 times [2025-03-17 15:09:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:09:23,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043021404] [2025-03-17 15:09:23,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:23,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:09:23,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 15:09:23,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 15:09:23,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:23,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:09:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 103 proven. 9 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 15:09:23,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:09:23,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043021404] [2025-03-17 15:09:23,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043021404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:09:23,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739478679] [2025-03-17 15:09:23,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:23,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:09:23,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:09:23,366 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:09:23,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-17 15:09:23,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 15:09:23,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 15:09:23,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:23,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:09:23,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:09:23,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:09:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 290 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 15:09:23,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:09:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 15:09:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739478679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:09:23,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:09:23,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 11 [2025-03-17 15:09:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982274927] [2025-03-17 15:09:23,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:09:23,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:09:23,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:09:23,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:09:23,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:09:23,672 INFO L87 Difference]: Start difference. First operand 734 states and 904 transitions. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 3 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-17 15:09:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:09:23,742 INFO L93 Difference]: Finished difference Result 792 states and 942 transitions. [2025-03-17 15:09:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:09:23,742 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 3 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 201 [2025-03-17 15:09:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:09:23,743 INFO L225 Difference]: With dead ends: 792 [2025-03-17 15:09:23,743 INFO L226 Difference]: Without dead ends: 263 [2025-03-17 15:09:23,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 395 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-17 15:09:23,744 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 243 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:09:23,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1319 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:09:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-17 15:09:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-03-17 15:09:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 215 states have (on average 1.1348837209302325) internal successors, (244), 244 states have internal predecessors, (244), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 15:09:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 274 transitions. [2025-03-17 15:09:23,751 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 274 transitions. Word has length 201 [2025-03-17 15:09:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:09:23,751 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 274 transitions. [2025-03-17 15:09:23,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 3 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-17 15:09:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 274 transitions. [2025-03-17 15:09:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 15:09:23,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:09:23,752 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:09:23,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-17 15:09:23,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-17 15:09:23,953 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:09:23,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:09:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1362259403, now seen corresponding path program 1 times [2025-03-17 15:09:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:09:23,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919198420] [2025-03-17 15:09:23,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:23,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:09:23,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 15:09:23,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 15:09:23,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:23,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:09:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-17 15:09:24,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:09:24,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919198420] [2025-03-17 15:09:24,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919198420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:09:24,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:09:24,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:09:24,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805968774] [2025-03-17 15:09:24,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:09:24,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:09:24,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:09:24,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:09:24,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:09:24,007 INFO L87 Difference]: Start difference. First operand 263 states and 274 transitions. Second operand has 5 states, 4 states have (on average 30.25) internal successors, (121), 5 states have internal predecessors, (121), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 15:09:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:09:24,195 INFO L93 Difference]: Finished difference Result 263 states and 274 transitions. [2025-03-17 15:09:24,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:09:24,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 30.25) internal successors, (121), 5 states have internal predecessors, (121), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 207 [2025-03-17 15:09:24,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:09:24,197 INFO L225 Difference]: With dead ends: 263 [2025-03-17 15:09:24,197 INFO L226 Difference]: Without dead ends: 256 [2025-03-17 15:09:24,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:09:24,197 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 277 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:09:24,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 208 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:09:24,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-17 15:09:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-17 15:09:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 215 states have (on average 1.1023255813953488) internal successors, (237), 237 states have internal predecessors, (237), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 15:09:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 267 transitions. [2025-03-17 15:09:24,208 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 267 transitions. Word has length 207 [2025-03-17 15:09:24,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:09:24,210 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 267 transitions. [2025-03-17 15:09:24,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 30.25) internal successors, (121), 5 states have internal predecessors, (121), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 15:09:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 267 transitions. [2025-03-17 15:09:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-17 15:09:24,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:09:24,211 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-17 15:09:24,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 15:09:24,211 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:09:24,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:09:24,212 INFO L85 PathProgramCache]: Analyzing trace with hash 719631560, now seen corresponding path program 1 times [2025-03-17 15:09:24,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:09:24,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645699098] [2025-03-17 15:09:24,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:09:24,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-17 15:09:24,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-17 15:09:24,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:24,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:09:24,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [798073685] [2025-03-17 15:09:24,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:24,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:09:24,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:09:24,234 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:09:24,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-17 15:09:24,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-17 15:09:24,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-17 15:09:24,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:24,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:09:24,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 15:09:24,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:09:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 33 proven. 72 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 15:09:24,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:09:25,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:09:25,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645699098] [2025-03-17 15:09:25,411 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:09:25,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798073685] [2025-03-17 15:09:25,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798073685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:09:25,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:09:25,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-03-17 15:09:25,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590431821] [2025-03-17 15:09:25,411 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:09:25,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 15:09:25,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:09:25,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 15:09:25,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:09:25,412 INFO L87 Difference]: Start difference. First operand 256 states and 267 transitions. Second operand has 14 states, 13 states have (on average 11.846153846153847) internal successors, (154), 14 states have internal predecessors, (154), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 15:09:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:09:26,132 INFO L93 Difference]: Finished difference Result 262 states and 273 transitions. [2025-03-17 15:09:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 15:09:26,133 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 11.846153846153847) internal successors, (154), 14 states have internal predecessors, (154), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 208 [2025-03-17 15:09:26,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:09:26,133 INFO L225 Difference]: With dead ends: 262 [2025-03-17 15:09:26,133 INFO L226 Difference]: Without dead ends: 242 [2025-03-17 15:09:26,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2025-03-17 15:09:26,134 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 129 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 2309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:09:26,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 330 Invalid, 2309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 15:09:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-17 15:09:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2025-03-17 15:09:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 215 states have (on average 1.0093023255813953) internal successors, (217), 217 states have internal predecessors, (217), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 15:09:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 247 transitions. [2025-03-17 15:09:26,142 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 247 transitions. Word has length 208 [2025-03-17 15:09:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:09:26,143 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 247 transitions. [2025-03-17 15:09:26,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 11.846153846153847) internal successors, (154), 14 states have internal predecessors, (154), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 15:09:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 247 transitions. [2025-03-17 15:09:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-17 15:09:26,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:09:26,144 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:09:26,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-17 15:09:26,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:09:26,344 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-17 15:09:26,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:09:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1331223752, now seen corresponding path program 1 times [2025-03-17 15:09:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:09:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564875883] [2025-03-17 15:09:26,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:09:26,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 15:09:26,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 15:09:26,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:26,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:09:26,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453270943] [2025-03-17 15:09:26,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:09:26,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:09:26,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:09:26,370 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:09:26,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-17 15:09:26,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 15:09:26,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 15:09:26,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:09:26,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:09:26,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 15:09:26,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:09:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 15:09:27,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:09:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 15:09:27,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:09:27,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564875883] [2025-03-17 15:09:27,462 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:09:27,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453270943] [2025-03-17 15:09:27,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453270943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:09:27,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:09:27,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-17 15:09:27,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741271442] [2025-03-17 15:09:27,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:09:27,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 15:09:27,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:09:27,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 15:09:27,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:09:27,463 INFO L87 Difference]: Start difference. First operand 236 states and 247 transitions. Second operand has 16 states, 15 states have (on average 26.866666666666667) internal successors, (403), 16 states have internal predecessors, (403), 6 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-17 15:09:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:09:27,760 INFO L93 Difference]: Finished difference Result 236 states and 247 transitions. [2025-03-17 15:09:27,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:09:27,760 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 26.866666666666667) internal successors, (403), 16 states have internal predecessors, (403), 6 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) Word has length 275 [2025-03-17 15:09:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:09:27,760 INFO L225 Difference]: With dead ends: 236 [2025-03-17 15:09:27,760 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:09:27,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:09:27,761 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 24 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:09:27,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 612 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:09:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:09:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:09:27,761 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-17 15:09:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:09:27,762 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2025-03-17 15:09:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:09:27,762 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:09:27,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 26.866666666666667) internal successors, (403), 16 states have internal predecessors, (403), 6 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-17 15:09:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:09:27,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 140 remaining) [2025-03-17 15:09:27,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 140 remaining) [2025-03-17 15:09:27,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 140 remaining) [2025-03-17 15:09:27,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 140 remaining) [2025-03-17 15:09:27,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 140 remaining) [2025-03-17 15:09:27,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 140 remaining) [2025-03-17 15:09:27,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-17 15:09:27,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:09:27,970 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:09:27,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:09:28,880 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:09:28,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:09:28 BoogieIcfgContainer [2025-03-17 15:09:28,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:09:28,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:09:28,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:09:28,891 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:09:28,891 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:08:28" (3/4) ... [2025-03-17 15:09:28,893 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:09:28,897 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 15:09:28,903 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 15:09:28,905 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:09:28,905 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:09:28,906 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:09:28,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:09:28,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:09:28,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:09:28,984 INFO L158 Benchmark]: Toolchain (without parser) took 60913.46ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 124.7MB in the beginning and 201.2MB in the end (delta: -76.6MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2025-03-17 15:09:28,985 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:09:28,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.47ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 112.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:09:28,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.49ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 110.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:09:28,985 INFO L158 Benchmark]: Boogie Preprocessor took 39.14ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:09:28,985 INFO L158 Benchmark]: IcfgBuilder took 625.89ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 70.3MB in the end (delta: 39.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 15:09:28,986 INFO L158 Benchmark]: TraceAbstraction took 59901.18ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 70.3MB in the beginning and 209.4MB in the end (delta: -139.2MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. [2025-03-17 15:09:28,986 INFO L158 Benchmark]: Witness Printer took 93.37ms. Allocated memory is still 293.6MB. Free memory was 209.4MB in the beginning and 201.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:09:28,986 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.26ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.47ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 112.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.49ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 110.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.14ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 625.89ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 70.3MB in the end (delta: 39.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 59901.18ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 70.3MB in the beginning and 209.4MB in the end (delta: -139.2MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. * Witness Printer took 93.37ms. Allocated memory is still 293.6MB. Free memory was 209.4MB in the beginning and 201.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: 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: 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: 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: 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: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: 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: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: 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: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: 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: 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: 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 - 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 - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 302 locations, 326 edges, 140 error locations. Started 1 CEGAR loops. OverallTime: 58.9s, OverallIterations: 43, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11530 SdHoareTripleChecker+Valid, 25.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11281 mSDsluCounter, 25461 SdHoareTripleChecker+Invalid, 22.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15594 mSDsCounter, 729 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29847 IncrementalHoareTripleChecker+Invalid, 30576 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 729 mSolverCounterUnsat, 9867 mSDtfsCounter, 29847 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5886 GetRequests, 5610 SyntacticMatches, 9 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=734occurred in iteration=39, InterpolantAutomatonStates: 262, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 43 MinimizatonAttempts, 1598 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 8825 NumberOfCodeBlocks, 8825 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 7478 ConstructedInterpolants, 9 QuantifiedInterpolants, 48013 SizeOfPredicates, 35 NumberOfNonLiveVariables, 6123 ConjunctsInSsa, 249 ConjunctsInUnsatCore, 62 InterpolantComputations, 24 PerfectInterpolantSequences, 7819/9124 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 140 specifications checked. All of them hold - InvariantResult [Line: 33]: Location Invariant Derived location invariant: (((((((((7 == y) && (z == 12)) && (x == 1)) && (n == 1)) && (0 <= a)) && (counter == 1)) && (a <= 32767)) || ((((((y == 1) && (counter == 0)) && ((((a + 1) <= 0) && (0 <= (a + 32768))) || ((0 <= a) && (a <= 32767)))) && (n == 0)) && (x == 0)) && (6 == z))) || ((((((((n <= 357913941) && (1 <= a)) && (x == 8)) && (1 <= n)) && (19 == y)) && (counter == 2)) && (a <= 32767)) && (z == 18))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:09:29,012 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