./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound20.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 cb384ff5c9201b9f90543357d3375f0a0ac9cc5fac01729f538d89799a1d7226 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:51:46,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:51:46,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:51:46,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:51:46,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:51:46,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:51:46,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:51:46,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:51:46,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:51:46,302 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:51:46,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:51:46,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:51:46,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:51:46,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:51:46,303 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:51:46,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:51:46,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:51:46,303 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:51:46,303 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:51:46,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:51:46,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:51:46,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:51:46,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:51:46,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:51:46,304 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:51:46,304 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:51:46,304 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:51:46,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:51:46,304 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:51:46,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:51:46,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:51:46,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:51:46,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:51:46,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:51:46,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:51:46,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:51:46,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:51:46,306 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:51:46,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:51:46,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:51:46,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:51:46,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:51:46,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:51:46,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:51:46,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:51:46,306 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 -> cb384ff5c9201b9f90543357d3375f0a0ac9cc5fac01729f538d89799a1d7226 [2025-03-04 10:51:46,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:51:46,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:51:46,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:51:46,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:51:46,516 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:51:46,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound20.c [2025-03-04 10:51:47,645 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94ee2559/0894375f21494ecd83684efb6e7b026c/FLAGb6d0fc1a8 [2025-03-04 10:51:47,889 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:51:47,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound20.c [2025-03-04 10:51:47,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94ee2559/0894375f21494ecd83684efb6e7b026c/FLAGb6d0fc1a8 [2025-03-04 10:51:48,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94ee2559/0894375f21494ecd83684efb6e7b026c [2025-03-04 10:51:48,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:51:48,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:51:48,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:51:48,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:51:48,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:51:48,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12204510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48, skipping insertion in model container [2025-03-04 10:51:48,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:51:48,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:51:48,353 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:51:48,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:51:48,379 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:51:48,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48 WrapperNode [2025-03-04 10:51:48,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:51:48,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:51:48,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:51:48,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:51:48,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,406 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2025-03-04 10:51:48,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:51:48,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:51:48,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:51:48,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:51:48,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,426 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:51:48,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:51:48,432 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:51:48,432 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:51:48,432 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:51:48,433 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (1/1) ... [2025-03-04 10:51:48,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:51:48,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:48,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:51:48,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:51:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:51:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 10:51:48,479 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 10:51:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:51:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:51:48,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:51:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:51:48,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:51:48,524 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:51:48,526 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:51:48,820 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2025-03-04 10:51:48,822 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:51:48,832 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:51:48,835 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:51:48,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:51:48 BoogieIcfgContainer [2025-03-04 10:51:48,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:51:48,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:51:48,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:51:48,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:51:48,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:51:48" (1/3) ... [2025-03-04 10:51:48,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fddb0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:51:48, skipping insertion in model container [2025-03-04 10:51:48,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:48" (2/3) ... [2025-03-04 10:51:48,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fddb0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:51:48, skipping insertion in model container [2025-03-04 10:51:48,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:51:48" (3/3) ... [2025-03-04 10:51:48,844 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound20.c [2025-03-04 10:51:48,854 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:51:48,855 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_valuebound20.c that has 3 procedures, 140 locations, 1 initial locations, 1 loop locations, and 58 error locations. [2025-03-04 10:51:48,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:51:48,899 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;@23887d56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:51:48,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-03-04 10:51:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 75 states have (on average 1.84) internal successors, (138), 133 states have internal predecessors, (138), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:51:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:51:48,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:48,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:48,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:48,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash 234381216, now seen corresponding path program 1 times [2025-03-04 10:51:48,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:48,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416097788] [2025-03-04 10:51:48,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:48,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:51:48,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:51:48,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:48,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:51:49,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:49,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416097788] [2025-03-04 10:51:49,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416097788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:49,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290844417] [2025-03-04 10:51:49,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:49,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:49,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:49,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:49,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:51:49,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:51:49,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:51:49,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:49,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:49,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 10:51:49,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:51:49,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:49,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290844417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:49,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:49,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 10:51:49,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621970908] [2025-03-04 10:51:49,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:49,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:51:49,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:49,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:51:49,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:51:49,078 INFO L87 Difference]: Start difference. First operand has 140 states, 75 states have (on average 1.84) internal successors, (138), 133 states have internal predecessors, (138), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:49,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:49,100 INFO L93 Difference]: Finished difference Result 276 states and 291 transitions. [2025-03-04 10:51:49,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:51:49,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-04 10:51:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:49,107 INFO L225 Difference]: With dead ends: 276 [2025-03-04 10:51:49,107 INFO L226 Difference]: Without dead ends: 133 [2025-03-04 10:51:49,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:51:49,112 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:49,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:51:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-04 10:51:49,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-04 10:51:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 127 states have internal predecessors, (129), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2025-03-04 10:51:49,148 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 14 [2025-03-04 10:51:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:49,149 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2025-03-04 10:51:49,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2025-03-04 10:51:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:51:49,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:49,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:49,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:51:49,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 10:51:49,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:49,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash 37897502, now seen corresponding path program 1 times [2025-03-04 10:51:49,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:49,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542153178] [2025-03-04 10:51:49,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:49,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:51:49,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:51:49,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:49,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:49,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:49,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542153178] [2025-03-04 10:51:49,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542153178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:49,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:49,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:51:49,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186991384] [2025-03-04 10:51:49,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:49,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:51:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:49,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:51:49,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:49,434 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:49,562 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2025-03-04 10:51:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:51:49,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-04 10:51:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:49,563 INFO L225 Difference]: With dead ends: 133 [2025-03-04 10:51:49,563 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 10:51:49,564 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-04 10:51:49,564 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 88 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:49,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 83 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 10:51:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-04 10:51:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 123 states have internal predecessors, (125), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2025-03-04 10:51:49,570 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 14 [2025-03-04 10:51:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:49,572 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2025-03-04 10:51:49,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:49,572 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2025-03-04 10:51:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:51:49,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:49,573 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:49,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:51:49,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:49,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1174822655, now seen corresponding path program 1 times [2025-03-04 10:51:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309599762] [2025-03-04 10:51:49,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:49,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:51:49,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:51:49,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:49,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:49,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:49,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309599762] [2025-03-04 10:51:49,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309599762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:49,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:49,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:51:49,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991856139] [2025-03-04 10:51:49,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:49,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:51:49,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:49,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:51:49,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:49,630 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:49,713 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2025-03-04 10:51:49,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:51:49,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-03-04 10:51:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:49,714 INFO L225 Difference]: With dead ends: 129 [2025-03-04 10:51:49,714 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 10:51:49,715 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-04 10:51:49,715 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 87 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:49,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 83 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:49,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 10:51:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-04 10:51:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 70 states have (on average 1.7285714285714286) internal successors, (121), 119 states have internal predecessors, (121), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2025-03-04 10:51:49,720 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 15 [2025-03-04 10:51:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:49,720 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2025-03-04 10:51:49,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2025-03-04 10:51:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:51:49,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:49,721 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:49,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:51:49,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:49,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2059764028, now seen corresponding path program 1 times [2025-03-04 10:51:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:49,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513704981] [2025-03-04 10:51:49,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:49,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:51:49,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:51:49,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:49,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:49,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:49,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513704981] [2025-03-04 10:51:49,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513704981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:49,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:49,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517266226] [2025-03-04 10:51:49,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:49,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:49,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:49,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:49,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:49,762 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:49,940 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2025-03-04 10:51:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:51:49,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2025-03-04 10:51:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:49,941 INFO L225 Difference]: With dead ends: 125 [2025-03-04 10:51:49,941 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 10:51:49,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:49,942 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 169 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:49,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 78 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 10:51:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 10:51:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2025-03-04 10:51:49,952 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 16 [2025-03-04 10:51:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:49,952 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2025-03-04 10:51:49,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2025-03-04 10:51:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:51:49,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:49,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:49,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:51:49,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:49,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:49,953 INFO L85 PathProgramCache]: Analyzing trace with hash -571824483, now seen corresponding path program 1 times [2025-03-04 10:51:49,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:49,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507311392] [2025-03-04 10:51:49,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:49,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:49,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:51:49,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:51:49,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:49,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:50,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:50,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507311392] [2025-03-04 10:51:50,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507311392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:50,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:50,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:50,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639516577] [2025-03-04 10:51:50,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:50,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:50,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:50,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:50,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:50,012 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:50,137 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2025-03-04 10:51:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:51:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-03-04 10:51:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:50,139 INFO L225 Difference]: With dead ends: 122 [2025-03-04 10:51:50,139 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 10:51:50,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:50,139 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 168 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:50,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 78 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 10:51:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 10:51:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 113 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2025-03-04 10:51:50,147 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 17 [2025-03-04 10:51:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:50,147 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2025-03-04 10:51:50,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2025-03-04 10:51:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:51:50,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:50,147 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:50,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:51:50,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:50,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:50,150 INFO L85 PathProgramCache]: Analyzing trace with hash -546689703, now seen corresponding path program 1 times [2025-03-04 10:51:50,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:50,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133431273] [2025-03-04 10:51:50,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:50,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:50,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:51:50,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:51:50,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:50,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:50,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281962646] [2025-03-04 10:51:50,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:50,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:50,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:50,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:50,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:51:50,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:51:50,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:51:50,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:50,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:50,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:51:50,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:50,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:50,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133431273] [2025-03-04 10:51:50,202 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281962646] [2025-03-04 10:51:50,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281962646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:50,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:50,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:51:50,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606399872] [2025-03-04 10:51:50,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:50,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:51:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:50,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:51:50,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:50,203 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:50,246 INFO L93 Difference]: Finished difference Result 183 states and 188 transitions. [2025-03-04 10:51:50,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:51:50,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-04 10:51:50,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:50,247 INFO L225 Difference]: With dead ends: 183 [2025-03-04 10:51:50,247 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 10:51:50,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:50,248 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 57 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:50,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 215 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:51:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 10:51:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 143. [2025-03-04 10:51:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 136 states have internal predecessors, (153), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:51:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2025-03-04 10:51:50,254 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 18 [2025-03-04 10:51:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:50,254 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2025-03-04 10:51:50,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2025-03-04 10:51:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:51:50,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:50,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:50,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:51:50,455 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,SelfDestructingSolverStorable5 [2025-03-04 10:51:50,455 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:50,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1382791785, now seen corresponding path program 1 times [2025-03-04 10:51:50,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:50,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567948705] [2025-03-04 10:51:50,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:50,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:51:50,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:51:50,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:50,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:50,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330689394] [2025-03-04 10:51:50,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:50,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:50,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:50,472 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:50,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:51:50,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:51:50,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:51:50,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:50,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:50,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:51:50,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:50,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:50,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:50,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567948705] [2025-03-04 10:51:50,511 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:50,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330689394] [2025-03-04 10:51:50,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330689394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:50,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:50,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:51:50,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350455210] [2025-03-04 10:51:50,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:50,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:51:50,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:50,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:51:50,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:50,512 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:50,561 INFO L93 Difference]: Finished difference Result 239 states and 261 transitions. [2025-03-04 10:51:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:51:50,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-04 10:51:50,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:50,563 INFO L225 Difference]: With dead ends: 239 [2025-03-04 10:51:50,563 INFO L226 Difference]: Without dead ends: 233 [2025-03-04 10:51:50,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:50,563 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 87 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:50,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 215 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:51:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-04 10:51:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 191. [2025-03-04 10:51:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 140 states have (on average 1.6571428571428573) internal successors, (232), 183 states have internal predecessors, (232), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 242 transitions. [2025-03-04 10:51:50,579 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 242 transitions. Word has length 20 [2025-03-04 10:51:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:50,579 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 242 transitions. [2025-03-04 10:51:50,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 242 transitions. [2025-03-04 10:51:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 10:51:50,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:50,580 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:50,590 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-04 10:51:50,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:50,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:50,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:50,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1718008363, now seen corresponding path program 1 times [2025-03-04 10:51:50,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:50,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278337986] [2025-03-04 10:51:50,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:50,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:50,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:51:50,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:51:50,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:50,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:50,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066348414] [2025-03-04 10:51:50,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:50,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:50,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:50,799 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:50,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:51:50,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:51:50,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:51:50,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:50,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:50,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:51:50,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:50,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:50,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:50,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278337986] [2025-03-04 10:51:50,851 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:50,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066348414] [2025-03-04 10:51:50,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066348414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:50,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:50,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:50,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365033081] [2025-03-04 10:51:50,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:50,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:50,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:50,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:50,852 INFO L87 Difference]: Start difference. First operand 191 states and 242 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:50,997 INFO L93 Difference]: Finished difference Result 257 states and 311 transitions. [2025-03-04 10:51:50,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:50,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-04 10:51:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:50,998 INFO L225 Difference]: With dead ends: 257 [2025-03-04 10:51:50,998 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 10:51:50,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:50,999 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 121 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:50,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 228 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 10:51:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 192. [2025-03-04 10:51:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 184 states have internal predecessors, (232), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 242 transitions. [2025-03-04 10:51:51,005 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 242 transitions. Word has length 22 [2025-03-04 10:51:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:51,005 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 242 transitions. [2025-03-04 10:51:51,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2025-03-04 10:51:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:51:51,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:51,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:51,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:51:51,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:51,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:51,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1718651625, now seen corresponding path program 1 times [2025-03-04 10:51:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:51,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630567514] [2025-03-04 10:51:51,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:51,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:51,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:51:51,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:51:51,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:51,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:51,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433063673] [2025-03-04 10:51:51,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:51,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:51,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:51,216 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:51,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:51:51,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:51:51,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:51:51,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:51,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:51,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:51:51,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:51,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:51,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:51,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630567514] [2025-03-04 10:51:51,264 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:51,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433063673] [2025-03-04 10:51:51,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433063673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:51,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:51,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:51,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969166309] [2025-03-04 10:51:51,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:51,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:51,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:51,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:51,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:51,264 INFO L87 Difference]: Start difference. First operand 192 states and 242 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:51,368 INFO L93 Difference]: Finished difference Result 256 states and 309 transitions. [2025-03-04 10:51:51,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:51,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-04 10:51:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:51,370 INFO L225 Difference]: With dead ends: 256 [2025-03-04 10:51:51,370 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 10:51:51,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:51,371 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 119 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:51,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 231 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 10:51:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 193. [2025-03-04 10:51:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 142 states have (on average 1.6338028169014085) internal successors, (232), 185 states have internal predecessors, (232), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 242 transitions. [2025-03-04 10:51:51,380 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 242 transitions. Word has length 23 [2025-03-04 10:51:51,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:51,380 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 242 transitions. [2025-03-04 10:51:51,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 242 transitions. [2025-03-04 10:51:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:51:51,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:51,381 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:51,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:51:51,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:51,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:51,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:51,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1738592749, now seen corresponding path program 1 times [2025-03-04 10:51:51,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:51,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419096559] [2025-03-04 10:51:51,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:51,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:51,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:51:51,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:51:51,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:51,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:51,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72754891] [2025-03-04 10:51:51,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:51,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:51,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:51,599 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:51,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:51:51,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:51:51,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:51:51,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:51,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:51,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:51:51,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:51,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:51,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:51,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419096559] [2025-03-04 10:51:51,658 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:51,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72754891] [2025-03-04 10:51:51,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72754891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:51,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:51,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:51,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783268851] [2025-03-04 10:51:51,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:51,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:51,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:51,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:51,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:51,658 INFO L87 Difference]: Start difference. First operand 193 states and 242 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:51,770 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2025-03-04 10:51:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:51,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-04 10:51:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:51,771 INFO L225 Difference]: With dead ends: 252 [2025-03-04 10:51:51,771 INFO L226 Difference]: Without dead ends: 250 [2025-03-04 10:51:51,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:51,772 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 166 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:51,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 251 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-04 10:51:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 193. [2025-03-04 10:51:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 142 states have (on average 1.6126760563380282) internal successors, (229), 185 states have internal predecessors, (229), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 239 transitions. [2025-03-04 10:51:51,779 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 239 transitions. Word has length 24 [2025-03-04 10:51:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:51,780 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 239 transitions. [2025-03-04 10:51:51,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 239 transitions. [2025-03-04 10:51:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:51:51,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:51,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:51,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:51,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:51,982 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:51,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:51,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1938199701, now seen corresponding path program 1 times [2025-03-04 10:51:51,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:51,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247654402] [2025-03-04 10:51:51,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:51,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:51,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:51:51,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:51:51,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:51,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:51,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174033103] [2025-03-04 10:51:51,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:51,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:51,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:51,991 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:51,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:51:52,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:51:52,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:51:52,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:52,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:52,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:51:52,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:52,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:52,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:52,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:52,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247654402] [2025-03-04 10:51:52,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:52,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174033103] [2025-03-04 10:51:52,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174033103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:52,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:52,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:52,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450024014] [2025-03-04 10:51:52,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:52,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:52,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:52,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:52,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:52,041 INFO L87 Difference]: Start difference. First operand 193 states and 239 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:52,137 INFO L93 Difference]: Finished difference Result 250 states and 267 transitions. [2025-03-04 10:51:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:52,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-04 10:51:52,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:52,139 INFO L225 Difference]: With dead ends: 250 [2025-03-04 10:51:52,139 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 10:51:52,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:52,139 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 163 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:52,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 257 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 10:51:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 193. [2025-03-04 10:51:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 142 states have (on average 1.591549295774648) internal successors, (226), 185 states have internal predecessors, (226), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 236 transitions. [2025-03-04 10:51:52,149 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 236 transitions. Word has length 25 [2025-03-04 10:51:52,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:52,149 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 236 transitions. [2025-03-04 10:51:52,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 236 transitions. [2025-03-04 10:51:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:51:52,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:52,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:52,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:52,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:52,351 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:52,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:52,351 INFO L85 PathProgramCache]: Analyzing trace with hash -45351343, now seen corresponding path program 1 times [2025-03-04 10:51:52,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:52,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419371199] [2025-03-04 10:51:52,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:52,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:52,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:51:52,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:51:52,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:52,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:52,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [627515686] [2025-03-04 10:51:52,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:52,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:52,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:52,365 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:52,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:51:52,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:51:52,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:51:52,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:52,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:52,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:51:52,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:52,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:52,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:52,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419371199] [2025-03-04 10:51:52,418 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:52,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627515686] [2025-03-04 10:51:52,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627515686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:52,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:52,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:51:52,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847721073] [2025-03-04 10:51:52,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:52,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:51:52,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:52,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:51:52,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:52,419 INFO L87 Difference]: Start difference. First operand 193 states and 236 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:52,615 INFO L93 Difference]: Finished difference Result 251 states and 299 transitions. [2025-03-04 10:51:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:51:52,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-04 10:51:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:52,616 INFO L225 Difference]: With dead ends: 251 [2025-03-04 10:51:52,616 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 10:51:52,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:51:52,617 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 108 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:52,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 294 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 10:51:52,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 196. [2025-03-04 10:51:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 145 states have (on average 1.5724137931034483) internal successors, (228), 188 states have internal predecessors, (228), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 238 transitions. [2025-03-04 10:51:52,623 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 238 transitions. Word has length 26 [2025-03-04 10:51:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:52,623 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 238 transitions. [2025-03-04 10:51:52,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 238 transitions. [2025-03-04 10:51:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:51:52,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:52,624 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:52,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:51:52,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:51:52,825 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:52,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:52,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1405891565, now seen corresponding path program 1 times [2025-03-04 10:51:52,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:52,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781286393] [2025-03-04 10:51:52,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:52,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:52,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:51:52,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:51:52,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:52,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:52,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246146818] [2025-03-04 10:51:52,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:52,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:52,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:52,842 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:52,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:51:52,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:51:52,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:51:52,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:52,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:52,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:51:52,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:52,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:52,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781286393] [2025-03-04 10:51:52,888 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246146818] [2025-03-04 10:51:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246146818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:52,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:52,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:51:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668434505] [2025-03-04 10:51:52,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:52,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:51:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:52,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:51:52,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:52,889 INFO L87 Difference]: Start difference. First operand 196 states and 238 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:53,019 INFO L93 Difference]: Finished difference Result 251 states and 266 transitions. [2025-03-04 10:51:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:51:53,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-04 10:51:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:53,021 INFO L225 Difference]: With dead ends: 251 [2025-03-04 10:51:53,021 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 10:51:53,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:51:53,021 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 225 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 257 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-04 10:51:53,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 257 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 10:51:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 196. [2025-03-04 10:51:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 145 states have (on average 1.5517241379310345) internal successors, (225), 188 states have internal predecessors, (225), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 235 transitions. [2025-03-04 10:51:53,028 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 235 transitions. Word has length 27 [2025-03-04 10:51:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:53,028 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 235 transitions. [2025-03-04 10:51:53,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 235 transitions. [2025-03-04 10:51:53,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:51:53,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:53,029 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:53,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:51:53,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:51:53,230 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:53,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash -632965489, now seen corresponding path program 1 times [2025-03-04 10:51:53,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:53,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095663286] [2025-03-04 10:51:53,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:53,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:53,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:51:53,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:51:53,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:53,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:53,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1804803001] [2025-03-04 10:51:53,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:53,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:53,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:53,243 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:53,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:51:53,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:51:53,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:51:53,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:53,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:53,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:51:53,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:53,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:53,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:53,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095663286] [2025-03-04 10:51:53,356 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:53,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804803001] [2025-03-04 10:51:53,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804803001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:53,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:53,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:51:53,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185109241] [2025-03-04 10:51:53,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:53,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:51:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:53,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:51:53,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:51:53,357 INFO L87 Difference]: Start difference. First operand 196 states and 235 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:53,575 INFO L93 Difference]: Finished difference Result 246 states and 293 transitions. [2025-03-04 10:51:53,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:51:53,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-04 10:51:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:53,576 INFO L225 Difference]: With dead ends: 246 [2025-03-04 10:51:53,576 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 10:51:53,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:51:53,577 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 242 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:53,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 211 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 10:51:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 198. [2025-03-04 10:51:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 147 states have (on average 1.5374149659863945) internal successors, (226), 190 states have internal predecessors, (226), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 236 transitions. [2025-03-04 10:51:53,582 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 236 transitions. Word has length 28 [2025-03-04 10:51:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:53,583 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 236 transitions. [2025-03-04 10:51:53,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 236 transitions. [2025-03-04 10:51:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 10:51:53,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:53,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:53,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:53,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:51:53,784 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:53,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1852906385, now seen corresponding path program 1 times [2025-03-04 10:51:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:53,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084590980] [2025-03-04 10:51:53,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:53,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:51:53,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:51:53,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:53,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:53,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:53,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084590980] [2025-03-04 10:51:53,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084590980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:53,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512742970] [2025-03-04 10:51:53,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:53,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:53,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:53,888 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:53,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:51:53,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:51:53,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:51:53,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:53,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:53,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:51:53,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:54,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:54,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512742970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:54,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:54,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:51:54,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406678869] [2025-03-04 10:51:54,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:54,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:51:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:54,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:51:54,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:51:54,007 INFO L87 Difference]: Start difference. First operand 198 states and 236 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:54,242 INFO L93 Difference]: Finished difference Result 246 states and 291 transitions. [2025-03-04 10:51:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:51:54,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-04 10:51:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:54,243 INFO L225 Difference]: With dead ends: 246 [2025-03-04 10:51:54,243 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 10:51:54,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:51:54,244 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 241 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:54,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 191 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 10:51:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 199. [2025-03-04 10:51:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 148 states have (on average 1.527027027027027) internal successors, (226), 191 states have internal predecessors, (226), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2025-03-04 10:51:54,249 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 29 [2025-03-04 10:51:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:54,249 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2025-03-04 10:51:54,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2025-03-04 10:51:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:51:54,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:54,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:54,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:54,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:51:54,454 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:54,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1014488843, now seen corresponding path program 1 times [2025-03-04 10:51:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:54,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026457852] [2025-03-04 10:51:54,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:54,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:54,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:51:54,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:51:54,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:54,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:54,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:54,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026457852] [2025-03-04 10:51:54,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026457852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:54,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:54,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:51:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619919664] [2025-03-04 10:51:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:54,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:51:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:54,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:51:54,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:51:54,545 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:54,682 INFO L93 Difference]: Finished difference Result 199 states and 236 transitions. [2025-03-04 10:51:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:51:54,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-04 10:51:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:54,683 INFO L225 Difference]: With dead ends: 199 [2025-03-04 10:51:54,683 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 10:51:54,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:51:54,684 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 113 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:54,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 191 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 10:51:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-04 10:51:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 189 states have internal predecessors, (221), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 231 transitions. [2025-03-04 10:51:54,691 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 231 transitions. Word has length 32 [2025-03-04 10:51:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:54,691 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 231 transitions. [2025-03-04 10:51:54,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:54,691 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 231 transitions. [2025-03-04 10:51:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 10:51:54,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:54,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:54,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:51:54,692 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:54,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1384383117, now seen corresponding path program 1 times [2025-03-04 10:51:54,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:54,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987027407] [2025-03-04 10:51:54,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:54,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:54,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:51:54,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:51:54,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:54,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:54,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858458354] [2025-03-04 10:51:54,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:54,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:54,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:54,709 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:54,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:51:54,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:51:54,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:51:54,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:54,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:54,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:51:54,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:54,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:54,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:54,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987027407] [2025-03-04 10:51:54,871 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:54,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858458354] [2025-03-04 10:51:54,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858458354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:54,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:54,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:51:54,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602271188] [2025-03-04 10:51:54,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:54,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:51:54,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:54,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:51:54,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:51:54,872 INFO L87 Difference]: Start difference. First operand 197 states and 231 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:55,132 INFO L93 Difference]: Finished difference Result 238 states and 283 transitions. [2025-03-04 10:51:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:51:55,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2025-03-04 10:51:55,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:55,134 INFO L225 Difference]: With dead ends: 238 [2025-03-04 10:51:55,134 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 10:51:55,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:51:55,135 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 231 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:55,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 153 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 10:51:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 201. [2025-03-04 10:51:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 152 states have (on average 1.4736842105263157) internal successors, (224), 193 states have internal predecessors, (224), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 234 transitions. [2025-03-04 10:51:55,141 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 234 transitions. Word has length 33 [2025-03-04 10:51:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:55,141 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 234 transitions. [2025-03-04 10:51:55,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 234 transitions. [2025-03-04 10:51:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 10:51:55,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:55,142 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:55,147 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-04 10:51:55,346 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,SelfDestructingSolverStorable16 [2025-03-04 10:51:55,346 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:55,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash -33796279, now seen corresponding path program 1 times [2025-03-04 10:51:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:55,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589015404] [2025-03-04 10:51:55,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:55,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:51:55,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:51:55,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:55,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589015404] [2025-03-04 10:51:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589015404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:55,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:55,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495801000] [2025-03-04 10:51:55,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:55,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:55,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:55,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:55,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:55,388 INFO L87 Difference]: Start difference. First operand 201 states and 234 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:55,558 INFO L93 Difference]: Finished difference Result 220 states and 259 transitions. [2025-03-04 10:51:55,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:55,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-03-04 10:51:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:55,559 INFO L225 Difference]: With dead ends: 220 [2025-03-04 10:51:55,559 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 10:51:55,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:55,560 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 92 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:55,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 146 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 10:51:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2025-03-04 10:51:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 194 states have internal predecessors, (224), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 234 transitions. [2025-03-04 10:51:55,567 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 234 transitions. Word has length 34 [2025-03-04 10:51:55,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:55,567 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 234 transitions. [2025-03-04 10:51:55,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 234 transitions. [2025-03-04 10:51:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 10:51:55,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:55,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:55,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:51:55,568 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1047684597, now seen corresponding path program 1 times [2025-03-04 10:51:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:55,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468711762] [2025-03-04 10:51:55,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:55,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:55,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:51:55,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:51:55,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:55,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:55,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:55,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468711762] [2025-03-04 10:51:55,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468711762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:55,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:55,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:55,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737158881] [2025-03-04 10:51:55,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:55,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:55,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:55,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:55,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:55,616 INFO L87 Difference]: Start difference. First operand 202 states and 234 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:55,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:55,799 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2025-03-04 10:51:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:51:55,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-03-04 10:51:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:55,800 INFO L225 Difference]: With dead ends: 220 [2025-03-04 10:51:55,800 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 10:51:55,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:55,801 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:55,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 159 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:55,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 10:51:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 203. [2025-03-04 10:51:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 154 states have (on average 1.4545454545454546) internal successors, (224), 195 states have internal predecessors, (224), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 234 transitions. [2025-03-04 10:51:55,807 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 234 transitions. Word has length 35 [2025-03-04 10:51:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:55,807 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 234 transitions. [2025-03-04 10:51:55,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 234 transitions. [2025-03-04 10:51:55,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 10:51:55,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:55,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:55,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:51:55,809 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:55,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:55,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2053735469, now seen corresponding path program 1 times [2025-03-04 10:51:55,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:55,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216542521] [2025-03-04 10:51:55,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:55,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:55,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:51:55,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:51:55,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:55,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:55,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:55,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216542521] [2025-03-04 10:51:55,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216542521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:55,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:55,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:51:55,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166333604] [2025-03-04 10:51:55,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:55,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:51:55,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:55,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:51:55,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:55,858 INFO L87 Difference]: Start difference. First operand 203 states and 234 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:56,030 INFO L93 Difference]: Finished difference Result 220 states and 255 transitions. [2025-03-04 10:51:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:56,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2025-03-04 10:51:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:56,031 INFO L225 Difference]: With dead ends: 220 [2025-03-04 10:51:56,031 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 10:51:56,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:51:56,032 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 304 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:56,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 128 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 10:51:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2025-03-04 10:51:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 163 states have (on average 1.4355828220858895) internal successors, (234), 204 states have internal predecessors, (234), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 244 transitions. [2025-03-04 10:51:56,037 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 244 transitions. Word has length 45 [2025-03-04 10:51:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:56,037 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 244 transitions. [2025-03-04 10:51:56,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 244 transitions. [2025-03-04 10:51:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 10:51:56,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:56,038 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:56,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:51:56,038 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:56,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:56,038 INFO L85 PathProgramCache]: Analyzing trace with hash 758709924, now seen corresponding path program 1 times [2025-03-04 10:51:56,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:56,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929850396] [2025-03-04 10:51:56,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:56,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:56,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:51:56,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:51:56,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:56,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:56,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:56,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929850396] [2025-03-04 10:51:56,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929850396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:56,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:56,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:56,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329876698] [2025-03-04 10:51:56,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:56,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:56,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:56,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:56,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:56,077 INFO L87 Difference]: Start difference. First operand 212 states and 244 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:56,154 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2025-03-04 10:51:56,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:51:56,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2025-03-04 10:51:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:56,155 INFO L225 Difference]: With dead ends: 212 [2025-03-04 10:51:56,155 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 10:51:56,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:56,155 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:56,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 149 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 10:51:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-04 10:51:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 163 states have (on average 1.4233128834355828) internal successors, (232), 203 states have internal predecessors, (232), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 242 transitions. [2025-03-04 10:51:56,163 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 242 transitions. Word has length 46 [2025-03-04 10:51:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:56,163 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 242 transitions. [2025-03-04 10:51:56,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 242 transitions. [2025-03-04 10:51:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:51:56,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:56,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:56,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:51:56,164 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:56,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:56,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1024202654, now seen corresponding path program 1 times [2025-03-04 10:51:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:56,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503035645] [2025-03-04 10:51:56,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:56,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:56,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:51:56,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:51:56,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:56,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:56,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:56,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503035645] [2025-03-04 10:51:56,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503035645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:56,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:56,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:56,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691741336] [2025-03-04 10:51:56,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:56,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:56,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:56,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:56,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:56,210 INFO L87 Difference]: Start difference. First operand 211 states and 242 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:56,259 INFO L93 Difference]: Finished difference Result 226 states and 259 transitions. [2025-03-04 10:51:56,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:51:56,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-03-04 10:51:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:56,262 INFO L225 Difference]: With dead ends: 226 [2025-03-04 10:51:56,262 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 10:51:56,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:56,263 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 17 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:56,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 310 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:51:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 10:51:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2025-03-04 10:51:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 173 states have (on average 1.416184971098266) internal successors, (245), 213 states have internal predecessors, (245), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2025-03-04 10:51:56,270 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 48 [2025-03-04 10:51:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:56,270 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2025-03-04 10:51:56,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2025-03-04 10:51:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:51:56,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:56,270 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:56,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:51:56,271 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:56,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash 336636291, now seen corresponding path program 1 times [2025-03-04 10:51:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921717979] [2025-03-04 10:51:56,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:56,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:51:56,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:51:56,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:56,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:56,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:56,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921717979] [2025-03-04 10:51:56,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921717979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:56,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:56,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:51:56,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447548470] [2025-03-04 10:51:56,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:56,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:51:56,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:56,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:51:56,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:56,327 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:56,476 INFO L93 Difference]: Finished difference Result 222 states and 255 transitions. [2025-03-04 10:51:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:56,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2025-03-04 10:51:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:56,477 INFO L225 Difference]: With dead ends: 222 [2025-03-04 10:51:56,477 INFO L226 Difference]: Without dead ends: 221 [2025-03-04 10:51:56,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:51:56,478 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 140 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:56,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 169 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-04 10:51:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-03-04 10:51:56,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 173 states have (on average 1.4104046242774566) internal successors, (244), 213 states have internal predecessors, (244), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 254 transitions. [2025-03-04 10:51:56,485 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 254 transitions. Word has length 48 [2025-03-04 10:51:56,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:56,486 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 254 transitions. [2025-03-04 10:51:56,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 254 transitions. [2025-03-04 10:51:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 10:51:56,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:56,487 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:56,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:51:56,487 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:56,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:56,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1845790462, now seen corresponding path program 1 times [2025-03-04 10:51:56,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:56,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665929438] [2025-03-04 10:51:56,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:56,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:56,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:51:56,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:51:56,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:56,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665929438] [2025-03-04 10:51:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665929438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:56,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:56,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:56,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933538411] [2025-03-04 10:51:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:56,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:56,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:56,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:56,541 INFO L87 Difference]: Start difference. First operand 221 states and 254 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:56,604 INFO L93 Difference]: Finished difference Result 258 states and 269 transitions. [2025-03-04 10:51:56,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:51:56,605 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2025-03-04 10:51:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:56,606 INFO L225 Difference]: With dead ends: 258 [2025-03-04 10:51:56,606 INFO L226 Difference]: Without dead ends: 256 [2025-03-04 10:51:56,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:56,607 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:56,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 307 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-04 10:51:56,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 229. [2025-03-04 10:51:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 181 states have (on average 1.3922651933701657) internal successors, (252), 221 states have internal predecessors, (252), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 262 transitions. [2025-03-04 10:51:56,615 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 262 transitions. Word has length 49 [2025-03-04 10:51:56,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:56,615 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 262 transitions. [2025-03-04 10:51:56,615 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:56,615 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 262 transitions. [2025-03-04 10:51:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 10:51:56,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:56,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:56,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 10:51:56,616 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:56,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:56,616 INFO L85 PathProgramCache]: Analyzing trace with hash -711239066, now seen corresponding path program 1 times [2025-03-04 10:51:56,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:56,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232935338] [2025-03-04 10:51:56,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:56,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:56,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:51:56,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:51:56,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:56,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:56,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177940367] [2025-03-04 10:51:56,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:56,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:56,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:56,632 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:56,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:51:56,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:51:56,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:51:56,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:56,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:56,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:51:56,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:56,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:56,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:56,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232935338] [2025-03-04 10:51:56,813 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:56,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177940367] [2025-03-04 10:51:56,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177940367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:56,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:56,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:51:56,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571791633] [2025-03-04 10:51:56,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:56,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:51:56,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:56,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:51:56,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:51:56,814 INFO L87 Difference]: Start difference. First operand 229 states and 262 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:56,981 INFO L93 Difference]: Finished difference Result 229 states and 262 transitions. [2025-03-04 10:51:56,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:51:56,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2025-03-04 10:51:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:56,983 INFO L225 Difference]: With dead ends: 229 [2025-03-04 10:51:56,983 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 10:51:56,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:51:56,984 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 118 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:56,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 339 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:56,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 10:51:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-03-04 10:51:56,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 181 states have (on average 1.3591160220994476) internal successors, (246), 218 states have internal predecessors, (246), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 256 transitions. [2025-03-04 10:51:56,993 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 256 transitions. Word has length 50 [2025-03-04 10:51:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:56,993 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 256 transitions. [2025-03-04 10:51:56,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 256 transitions. [2025-03-04 10:51:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:51:56,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:56,994 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:57,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:57,194 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,SelfDestructingSolverStorable24 [2025-03-04 10:51:57,195 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:57,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:57,195 INFO L85 PathProgramCache]: Analyzing trace with hash -573574482, now seen corresponding path program 1 times [2025-03-04 10:51:57,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:57,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067215400] [2025-03-04 10:51:57,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:57,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:57,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:51:57,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:51:57,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:57,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005275539] [2025-03-04 10:51:57,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:57,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:57,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:57,209 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:57,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:51:57,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:51:57,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:51:57,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:57,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:57,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:51:57,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:57,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:57,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:57,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067215400] [2025-03-04 10:51:57,759 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:57,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005275539] [2025-03-04 10:51:57,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005275539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:57,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:57,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 10:51:57,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733925585] [2025-03-04 10:51:57,760 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:57,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:51:57,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:57,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:51:57,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:51:57,761 INFO L87 Difference]: Start difference. First operand 226 states and 256 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:58,104 INFO L93 Difference]: Finished difference Result 278 states and 316 transitions. [2025-03-04 10:51:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:51:58,105 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2025-03-04 10:51:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:58,106 INFO L225 Difference]: With dead ends: 278 [2025-03-04 10:51:58,106 INFO L226 Difference]: Without dead ends: 252 [2025-03-04 10:51:58,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:51:58,107 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 320 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:58,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 344 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:51:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-04 10:51:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 232. [2025-03-04 10:51:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 186 states have (on average 1.39247311827957) internal successors, (259), 223 states have internal predecessors, (259), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:51:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 271 transitions. [2025-03-04 10:51:58,117 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 271 transitions. Word has length 51 [2025-03-04 10:51:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:58,117 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 271 transitions. [2025-03-04 10:51:58,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 271 transitions. [2025-03-04 10:51:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 10:51:58,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:58,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:58,124 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-04 10:51:58,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:58,319 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:58,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:58,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1977408414, now seen corresponding path program 1 times [2025-03-04 10:51:58,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:58,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58777040] [2025-03-04 10:51:58,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:58,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:58,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:51:58,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:51:58,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:58,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:58,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [626834615] [2025-03-04 10:51:58,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:58,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:58,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:58,332 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:58,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:51:58,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:51:58,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:51:58,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:58,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:58,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:51:58,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:58,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:58,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:58,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58777040] [2025-03-04 10:51:58,657 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:58,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626834615] [2025-03-04 10:51:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626834615] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:58,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:51:58,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-04 10:51:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855992420] [2025-03-04 10:51:58,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:58,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:51:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:58,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:51:58,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:51:58,659 INFO L87 Difference]: Start difference. First operand 232 states and 271 transitions. Second operand has 15 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 10:51:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:59,158 INFO L93 Difference]: Finished difference Result 351 states and 420 transitions. [2025-03-04 10:51:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:51:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2025-03-04 10:51:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:59,159 INFO L225 Difference]: With dead ends: 351 [2025-03-04 10:51:59,159 INFO L226 Difference]: Without dead ends: 345 [2025-03-04 10:51:59,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:51:59,160 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 615 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:59,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 243 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:51:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-04 10:51:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 258. [2025-03-04 10:51:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 213 states have (on average 1.380281690140845) internal successors, (294), 248 states have internal predecessors, (294), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 10:51:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 308 transitions. [2025-03-04 10:51:59,168 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 308 transitions. Word has length 54 [2025-03-04 10:51:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:59,168 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 308 transitions. [2025-03-04 10:51:59,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 10:51:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 308 transitions. [2025-03-04 10:51:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:51:59,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:59,169 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:59,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:51:59,369 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,SelfDestructingSolverStorable26 [2025-03-04 10:51:59,369 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:59,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:59,370 INFO L85 PathProgramCache]: Analyzing trace with hash 49437665, now seen corresponding path program 1 times [2025-03-04 10:51:59,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:59,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452660432] [2025-03-04 10:51:59,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:59,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:59,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:51:59,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:51:59,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:59,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:59,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483997953] [2025-03-04 10:51:59,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:59,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:59,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:59,381 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:59,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:51:59,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:51:59,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:51:59,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:59,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:59,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:51:59,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:59,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:59,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:59,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452660432] [2025-03-04 10:51:59,653 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:59,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483997953] [2025-03-04 10:51:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483997953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:59,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:59,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 10:51:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32164727] [2025-03-04 10:51:59,653 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:59,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:51:59,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:59,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:51:59,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:51:59,654 INFO L87 Difference]: Start difference. First operand 258 states and 308 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:59,876 INFO L93 Difference]: Finished difference Result 268 states and 311 transitions. [2025-03-04 10:51:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:51:59,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2025-03-04 10:51:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:59,877 INFO L225 Difference]: With dead ends: 268 [2025-03-04 10:51:59,878 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 10:51:59,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:59,879 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 150 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:59,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 346 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 10:51:59,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2025-03-04 10:51:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 213 states have (on average 1.352112676056338) internal successors, (288), 244 states have internal predecessors, (288), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 10:51:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 302 transitions. [2025-03-04 10:51:59,887 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 302 transitions. Word has length 56 [2025-03-04 10:51:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:59,887 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 302 transitions. [2025-03-04 10:51:59,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 302 transitions. [2025-03-04 10:51:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 10:51:59,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:59,889 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 10:51:59,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:00,089 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,SelfDestructingSolverStorable27 [2025-03-04 10:52:00,089 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:00,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:00,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1532567695, now seen corresponding path program 1 times [2025-03-04 10:52:00,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:00,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149129390] [2025-03-04 10:52:00,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:00,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:00,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 10:52:00,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 10:52:00,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:00,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:00,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639351325] [2025-03-04 10:52:00,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:00,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:00,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:00,105 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:00,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:52:00,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 10:52:00,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 10:52:00,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:00,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:00,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:52:00,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:52:00,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:00,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:00,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149129390] [2025-03-04 10:52:00,557 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:00,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639351325] [2025-03-04 10:52:00,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639351325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:00,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:52:00,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:52:00,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400530107] [2025-03-04 10:52:00,557 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:00,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:52:00,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:00,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:52:00,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:52:00,558 INFO L87 Difference]: Start difference. First operand 254 states and 302 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:52:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:00,809 INFO L93 Difference]: Finished difference Result 336 states and 394 transitions. [2025-03-04 10:52:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:52:00,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2025-03-04 10:52:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:00,810 INFO L225 Difference]: With dead ends: 336 [2025-03-04 10:52:00,810 INFO L226 Difference]: Without dead ends: 334 [2025-03-04 10:52:00,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:52:00,811 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 309 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:00,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 418 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:52:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-04 10:52:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 292. [2025-03-04 10:52:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 250 states have (on average 1.384) internal successors, (346), 281 states have internal predecessors, (346), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:52:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 362 transitions. [2025-03-04 10:52:00,819 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 362 transitions. Word has length 57 [2025-03-04 10:52:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:00,819 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 362 transitions. [2025-03-04 10:52:00,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:52:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 362 transitions. [2025-03-04 10:52:00,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 10:52:00,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:00,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:00,825 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-04 10:52:01,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:52:01,020 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:01,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:01,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1048981922, now seen corresponding path program 1 times [2025-03-04 10:52:01,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:01,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989515381] [2025-03-04 10:52:01,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:01,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:01,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:52:01,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:52:01,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:01,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:01,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819875161] [2025-03-04 10:52:01,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:01,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:01,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:01,029 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:01,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:52:01,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:52:01,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:52:01,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:01,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:01,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:52:01,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:01,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:01,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:01,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989515381] [2025-03-04 10:52:01,157 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:01,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819875161] [2025-03-04 10:52:01,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819875161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:01,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:01,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2025-03-04 10:52:01,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419393824] [2025-03-04 10:52:01,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:01,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:52:01,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:01,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:52:01,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:52:01,158 INFO L87 Difference]: Start difference. First operand 292 states and 362 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:52:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:01,293 INFO L93 Difference]: Finished difference Result 333 states and 389 transitions. [2025-03-04 10:52:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:52:01,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2025-03-04 10:52:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:01,294 INFO L225 Difference]: With dead ends: 333 [2025-03-04 10:52:01,294 INFO L226 Difference]: Without dead ends: 331 [2025-03-04 10:52:01,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:52:01,295 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 201 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:01,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 275 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:52:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-04 10:52:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 292. [2025-03-04 10:52:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 250 states have (on average 1.372) internal successors, (343), 281 states have internal predecessors, (343), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:52:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 359 transitions. [2025-03-04 10:52:01,302 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 359 transitions. Word has length 58 [2025-03-04 10:52:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:01,302 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 359 transitions. [2025-03-04 10:52:01,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:52:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 359 transitions. [2025-03-04 10:52:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:52:01,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:01,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:01,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:01,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:01,503 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:01,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1245689692, now seen corresponding path program 1 times [2025-03-04 10:52:01,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:01,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912204573] [2025-03-04 10:52:01,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:01,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:01,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:52:01,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:52:01,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:01,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:01,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140675836] [2025-03-04 10:52:01,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:01,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:01,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:01,513 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:01,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:52:01,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:52:01,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:52:01,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:01,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:01,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:52:01,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:52:01,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:52:01,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:01,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912204573] [2025-03-04 10:52:01,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:01,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140675836] [2025-03-04 10:52:01,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140675836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:01,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:01,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-04 10:52:01,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366221012] [2025-03-04 10:52:01,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:01,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:52:01,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:01,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:52:01,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:52:01,867 INFO L87 Difference]: Start difference. First operand 292 states and 359 transitions. Second operand has 13 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:03,048 INFO L93 Difference]: Finished difference Result 338 states and 412 transitions. [2025-03-04 10:52:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:52:03,049 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2025-03-04 10:52:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:03,049 INFO L225 Difference]: With dead ends: 338 [2025-03-04 10:52:03,049 INFO L226 Difference]: Without dead ends: 336 [2025-03-04 10:52:03,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:52:03,050 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 346 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:03,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 357 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 10:52:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-04 10:52:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 297. [2025-03-04 10:52:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 255 states have (on average 1.3607843137254902) internal successors, (347), 286 states have internal predecessors, (347), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:52:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 363 transitions. [2025-03-04 10:52:03,059 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 363 transitions. Word has length 60 [2025-03-04 10:52:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:03,059 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 363 transitions. [2025-03-04 10:52:03,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 363 transitions. [2025-03-04 10:52:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:52:03,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:03,060 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:03,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:03,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:03,260 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:03,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:03,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1221922653, now seen corresponding path program 1 times [2025-03-04 10:52:03,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:03,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415567663] [2025-03-04 10:52:03,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:03,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:03,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:52:03,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:52:03,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:03,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:03,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281090268] [2025-03-04 10:52:03,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:03,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:03,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:03,272 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:03,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:52:03,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:52:03,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:52:03,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:03,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:03,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:52:03,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:52:03,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415567663] [2025-03-04 10:52:03,544 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:03,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281090268] [2025-03-04 10:52:03,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281090268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:03,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:52:03,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 10:52:03,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58179574] [2025-03-04 10:52:03,544 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:03,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:52:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:03,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:52:03,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:52:03,545 INFO L87 Difference]: Start difference. First operand 297 states and 363 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:52:03,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:03,893 INFO L93 Difference]: Finished difference Result 315 states and 381 transitions. [2025-03-04 10:52:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:52:03,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2025-03-04 10:52:03,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:03,894 INFO L225 Difference]: With dead ends: 315 [2025-03-04 10:52:03,894 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 10:52:03,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:52:03,895 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 294 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:03,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 289 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:52:03,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 10:52:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 295. [2025-03-04 10:52:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 255 states have (on average 1.3411764705882352) internal successors, (342), 284 states have internal predecessors, (342), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:52:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2025-03-04 10:52:03,905 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 60 [2025-03-04 10:52:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:03,905 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2025-03-04 10:52:03,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:52:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2025-03-04 10:52:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 10:52:03,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:03,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:03,911 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-04 10:52:04,106 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,SelfDestructingSolverStorable31 [2025-03-04 10:52:04,106 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:04,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash -38325148, now seen corresponding path program 1 times [2025-03-04 10:52:04,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:04,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105508076] [2025-03-04 10:52:04,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:04,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:04,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:52:04,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:52:04,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:04,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:52:04,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:04,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105508076] [2025-03-04 10:52:04,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105508076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:04,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409042269] [2025-03-04 10:52:04,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:04,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:04,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:04,158 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:04,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:52:04,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:52:04,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:52:04,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:04,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:04,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:52:04,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:52:04,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:52:04,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409042269] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:04,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:04,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-03-04 10:52:04,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302729972] [2025-03-04 10:52:04,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:04,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:52:04,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:04,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:52:04,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:52:04,307 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand has 11 states, 10 states have (on average 12.1) internal successors, (121), 11 states have internal predecessors, (121), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 10:52:04,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:04,521 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2025-03-04 10:52:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:52:04,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.1) internal successors, (121), 11 states have internal predecessors, (121), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 61 [2025-03-04 10:52:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:04,523 INFO L225 Difference]: With dead ends: 295 [2025-03-04 10:52:04,523 INFO L226 Difference]: Without dead ends: 293 [2025-03-04 10:52:04,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:52:04,524 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 143 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:04,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 287 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:52:04,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-04 10:52:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-04 10:52:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 255 states have (on average 1.3137254901960784) internal successors, (335), 282 states have internal predecessors, (335), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:52:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 351 transitions. [2025-03-04 10:52:04,533 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 351 transitions. Word has length 61 [2025-03-04 10:52:04,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:04,533 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 351 transitions. [2025-03-04 10:52:04,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.1) internal successors, (121), 11 states have internal predecessors, (121), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 10:52:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 351 transitions. [2025-03-04 10:52:04,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 10:52:04,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:04,534 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:04,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 10:52:04,737 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,SelfDestructingSolverStorable32 [2025-03-04 10:52:04,737 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:04,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash -775103349, now seen corresponding path program 1 times [2025-03-04 10:52:04,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:04,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239089286] [2025-03-04 10:52:04,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:04,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:52:04,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:52:04,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:04,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:04,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325490021] [2025-03-04 10:52:04,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:04,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:04,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:04,748 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-04 10:52:04,748 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-04 10:52:04,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:52:04,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:52:04,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:04,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:04,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:52:04,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:52:04,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:52:05,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:05,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239089286] [2025-03-04 10:52:05,153 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:05,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325490021] [2025-03-04 10:52:05,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325490021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:05,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:05,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-04 10:52:05,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430379922] [2025-03-04 10:52:05,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:05,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:52:05,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:05,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:52:05,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:52:05,154 INFO L87 Difference]: Start difference. First operand 293 states and 351 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:05,791 INFO L93 Difference]: Finished difference Result 425 states and 477 transitions. [2025-03-04 10:52:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:52:05,792 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 61 [2025-03-04 10:52:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:05,793 INFO L225 Difference]: With dead ends: 425 [2025-03-04 10:52:05,793 INFO L226 Difference]: Without dead ends: 423 [2025-03-04 10:52:05,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:52:05,793 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 732 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:05,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 659 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:52:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-04 10:52:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 329. [2025-03-04 10:52:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 290 states have (on average 1.3206896551724139) internal successors, (383), 317 states have internal predecessors, (383), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:52:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 401 transitions. [2025-03-04 10:52:05,803 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 401 transitions. Word has length 61 [2025-03-04 10:52:05,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:05,803 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 401 transitions. [2025-03-04 10:52:05,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 401 transitions. [2025-03-04 10:52:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 10:52:05,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:05,804 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:05,810 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-04 10:52:06,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:06,005 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:06,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:06,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1741600027, now seen corresponding path program 1 times [2025-03-04 10:52:06,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:06,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547001158] [2025-03-04 10:52:06,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:06,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:06,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:52:06,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:52:06,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:06,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:06,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1322466331] [2025-03-04 10:52:06,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:06,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:06,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:06,015 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-04 10:52:06,017 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-04 10:52:06,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:52:06,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:52:06,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:06,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:06,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:52:06,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:52:06,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:52:06,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:06,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547001158] [2025-03-04 10:52:06,672 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:06,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322466331] [2025-03-04 10:52:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322466331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:06,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:06,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2025-03-04 10:52:06,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638925975] [2025-03-04 10:52:06,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:06,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:52:06,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:06,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:52:06,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:52:06,673 INFO L87 Difference]: Start difference. First operand 329 states and 401 transitions. Second operand has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 24 states have internal predecessors, (103), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:08,557 INFO L93 Difference]: Finished difference Result 515 states and 641 transitions. [2025-03-04 10:52:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 10:52:08,557 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 24 states have internal predecessors, (103), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 62 [2025-03-04 10:52:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:08,559 INFO L225 Difference]: With dead ends: 515 [2025-03-04 10:52:08,559 INFO L226 Difference]: Without dead ends: 511 [2025-03-04 10:52:08,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=635, Invalid=2905, Unknown=0, NotChecked=0, Total=3540 [2025-03-04 10:52:08,560 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 820 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:08,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 335 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 10:52:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-04 10:52:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 369. [2025-03-04 10:52:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 330 states have (on average 1.309090909090909) internal successors, (432), 357 states have internal predecessors, (432), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:52:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 450 transitions. [2025-03-04 10:52:08,572 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 450 transitions. Word has length 62 [2025-03-04 10:52:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:08,572 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 450 transitions. [2025-03-04 10:52:08,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 24 states have internal predecessors, (103), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 450 transitions. [2025-03-04 10:52:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 10:52:08,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:08,573 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:08,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 10:52:08,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:08,775 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:08,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1844973943, now seen corresponding path program 1 times [2025-03-04 10:52:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:08,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913892379] [2025-03-04 10:52:08,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:08,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 10:52:08,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:52:08,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:08,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:08,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941735834] [2025-03-04 10:52:08,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:08,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:08,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:08,785 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-04 10:52:08,786 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-04 10:52:08,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 10:52:08,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:52:08,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:08,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:08,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:52:08,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:52:09,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:09,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:09,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913892379] [2025-03-04 10:52:09,422 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:09,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941735834] [2025-03-04 10:52:09,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941735834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:09,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:52:09,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 10:52:09,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122448701] [2025-03-04 10:52:09,422 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:09,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:52:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:09,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:52:09,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:52:09,423 INFO L87 Difference]: Start difference. First operand 369 states and 450 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:52:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:09,932 INFO L93 Difference]: Finished difference Result 395 states and 469 transitions. [2025-03-04 10:52:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:52:09,932 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2025-03-04 10:52:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:09,933 INFO L225 Difference]: With dead ends: 395 [2025-03-04 10:52:09,933 INFO L226 Difference]: Without dead ends: 391 [2025-03-04 10:52:09,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:52:09,934 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 241 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:09,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 404 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:52:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-04 10:52:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 376. [2025-03-04 10:52:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 337 states have (on average 1.2997032640949555) internal successors, (438), 364 states have internal predecessors, (438), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:52:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 456 transitions. [2025-03-04 10:52:09,952 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 456 transitions. Word has length 63 [2025-03-04 10:52:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:09,952 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 456 transitions. [2025-03-04 10:52:09,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:52:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 456 transitions. [2025-03-04 10:52:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 10:52:09,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:09,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:09,959 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-04 10:52:10,153 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,SelfDestructingSolverStorable35 [2025-03-04 10:52:10,154 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:10,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:10,154 INFO L85 PathProgramCache]: Analyzing trace with hash 748386784, now seen corresponding path program 1 times [2025-03-04 10:52:10,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:10,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853380538] [2025-03-04 10:52:10,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:10,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 10:52:10,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 10:52:10,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:10,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:52:10,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853380538] [2025-03-04 10:52:10,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853380538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611216373] [2025-03-04 10:52:10,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:10,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:10,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:10,196 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-04 10:52:10,198 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-04 10:52:10,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 10:52:10,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 10:52:10,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:10,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:10,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:52:10,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:52:10,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:52:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611216373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:10,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:10,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:52:10,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715465668] [2025-03-04 10:52:10,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:10,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:52:10,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:10,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:52:10,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:52:10,382 INFO L87 Difference]: Start difference. First operand 376 states and 456 transitions. Second operand has 9 states, 8 states have (on average 13.375) internal successors, (107), 9 states have internal predecessors, (107), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:10,713 INFO L93 Difference]: Finished difference Result 532 states and 667 transitions. [2025-03-04 10:52:10,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:52:10,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 13.375) internal successors, (107), 9 states have internal predecessors, (107), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 65 [2025-03-04 10:52:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:10,715 INFO L225 Difference]: With dead ends: 532 [2025-03-04 10:52:10,715 INFO L226 Difference]: Without dead ends: 530 [2025-03-04 10:52:10,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:52:10,715 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 198 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:10,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 316 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:52:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-04 10:52:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 500. [2025-03-04 10:52:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 458 states have (on average 1.334061135371179) internal successors, (611), 485 states have internal predecessors, (611), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:52:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 635 transitions. [2025-03-04 10:52:10,730 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 635 transitions. Word has length 65 [2025-03-04 10:52:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:10,730 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 635 transitions. [2025-03-04 10:52:10,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 13.375) internal successors, (107), 9 states have internal predecessors, (107), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 635 transitions. [2025-03-04 10:52:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 10:52:10,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:10,730 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 10:52:10,736 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-04 10:52:10,930 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,SelfDestructingSolverStorable36 [2025-03-04 10:52:10,931 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:10,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1725153878, now seen corresponding path program 1 times [2025-03-04 10:52:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:10,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335840321] [2025-03-04 10:52:10,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:10,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:10,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 10:52:10,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 10:52:10,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:10,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:52:10,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:10,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335840321] [2025-03-04 10:52:10,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335840321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:10,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:52:10,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:52:10,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067315683] [2025-03-04 10:52:10,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:10,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:52:10,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:10,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:52:10,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:52:10,969 INFO L87 Difference]: Start difference. First operand 500 states and 635 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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-04 10:52:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:11,162 INFO L93 Difference]: Finished difference Result 734 states and 953 transitions. [2025-03-04 10:52:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:52:11,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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 66 [2025-03-04 10:52:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:11,164 INFO L225 Difference]: With dead ends: 734 [2025-03-04 10:52:11,164 INFO L226 Difference]: Without dead ends: 732 [2025-03-04 10:52:11,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:52:11,165 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 82 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:11,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 325 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:52:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-04 10:52:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 667. [2025-03-04 10:52:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 620 states have (on average 1.3516129032258064) internal successors, (838), 647 states have internal predecessors, (838), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:52:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 872 transitions. [2025-03-04 10:52:11,197 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 872 transitions. Word has length 66 [2025-03-04 10:52:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:11,197 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 872 transitions. [2025-03-04 10:52:11,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 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-04 10:52:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 872 transitions. [2025-03-04 10:52:11,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 10:52:11,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:11,198 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 10:52:11,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 10:52:11,198 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:11,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:11,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1940162718, now seen corresponding path program 1 times [2025-03-04 10:52:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:11,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395958458] [2025-03-04 10:52:11,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:11,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:11,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 10:52:11,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 10:52:11,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:11,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:52:11,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:11,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395958458] [2025-03-04 10:52:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395958458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:11,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976920233] [2025-03-04 10:52:11,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:11,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:11,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:11,303 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-04 10:52:11,304 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-04 10:52:11,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 10:52:11,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 10:52:11,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:11,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:11,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:52:11,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:52:11,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:52:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976920233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:11,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:52:11,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-04 10:52:11,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107880402] [2025-03-04 10:52:11,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:11,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:52:11,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:11,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:52:11,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:52:11,551 INFO L87 Difference]: Start difference. First operand 667 states and 872 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:52:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:11,751 INFO L93 Difference]: Finished difference Result 684 states and 887 transitions. [2025-03-04 10:52:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:52:11,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2025-03-04 10:52:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:11,753 INFO L225 Difference]: With dead ends: 684 [2025-03-04 10:52:11,753 INFO L226 Difference]: Without dead ends: 682 [2025-03-04 10:52:11,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:52:11,753 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 176 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:11,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 222 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:52:11,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-04 10:52:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 675. [2025-03-04 10:52:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 628 states have (on average 1.3455414012738853) internal successors, (845), 655 states have internal predecessors, (845), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:52:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 879 transitions. [2025-03-04 10:52:11,773 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 879 transitions. Word has length 67 [2025-03-04 10:52:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:11,774 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 879 transitions. [2025-03-04 10:52:11,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:52:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 879 transitions. [2025-03-04 10:52:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 10:52:11,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:11,774 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 10:52:11,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-04 10:52:11,979 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,SelfDestructingSolverStorable38 [2025-03-04 10:52:11,979 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:11,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:11,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1802017811, now seen corresponding path program 1 times [2025-03-04 10:52:11,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:11,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862259897] [2025-03-04 10:52:11,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:11,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:11,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:52:11,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:52:11,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:11,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:11,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1793546822] [2025-03-04 10:52:11,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:11,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:11,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:11,990 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-04 10:52:11,991 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-04 10:52:12,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:52:12,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:52:12,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:12,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:12,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:52:12,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:52:12,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:52:12,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:12,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862259897] [2025-03-04 10:52:12,415 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:12,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793546822] [2025-03-04 10:52:12,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793546822] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:12,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:12,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2025-03-04 10:52:12,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403929613] [2025-03-04 10:52:12,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:12,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:52:12,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:12,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:52:12,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:52:12,415 INFO L87 Difference]: Start difference. First operand 675 states and 879 transitions. Second operand has 15 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:13,670 INFO L93 Difference]: Finished difference Result 692 states and 895 transitions. [2025-03-04 10:52:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 10:52:13,670 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 70 [2025-03-04 10:52:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:13,672 INFO L225 Difference]: With dead ends: 692 [2025-03-04 10:52:13,672 INFO L226 Difference]: Without dead ends: 689 [2025-03-04 10:52:13,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:52:13,673 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 297 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:13,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 162 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 10:52:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-04 10:52:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 685. [2025-03-04 10:52:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 639 states have (on average 1.3333333333333333) internal successors, (852), 665 states have internal predecessors, (852), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:52:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 886 transitions. [2025-03-04 10:52:13,702 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 886 transitions. Word has length 70 [2025-03-04 10:52:13,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:13,703 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 886 transitions. [2025-03-04 10:52:13,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 886 transitions. [2025-03-04 10:52:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 10:52:13,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:13,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:52:13,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 10:52:13,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 10:52:13,904 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:13,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:13,904 INFO L85 PathProgramCache]: Analyzing trace with hash 833523366, now seen corresponding path program 1 times [2025-03-04 10:52:13,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:13,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675425076] [2025-03-04 10:52:13,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:13,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:13,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:52:13,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:52:13,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:13,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:13,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:13,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675425076] [2025-03-04 10:52:13,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675425076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:13,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073237801] [2025-03-04 10:52:13,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:13,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:13,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:13,959 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-04 10:52:13,960 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-04 10:52:13,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:52:13,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:52:13,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:13,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:13,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:52:13,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:14,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:14,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073237801] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:14,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:14,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:52:14,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326919290] [2025-03-04 10:52:14,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:14,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:52:14,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:14,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:52:14,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:52:14,262 INFO L87 Difference]: Start difference. First operand 685 states and 886 transitions. Second operand has 13 states, 12 states have (on average 14.5) internal successors, (174), 13 states have internal predecessors, (174), 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-04 10:52:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:14,690 INFO L93 Difference]: Finished difference Result 1084 states and 1400 transitions. [2025-03-04 10:52:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:52:14,692 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 14.5) internal successors, (174), 13 states have internal predecessors, (174), 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) Word has length 77 [2025-03-04 10:52:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:14,695 INFO L225 Difference]: With dead ends: 1084 [2025-03-04 10:52:14,695 INFO L226 Difference]: Without dead ends: 1082 [2025-03-04 10:52:14,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:52:14,696 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 414 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:14,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 397 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:52:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-03-04 10:52:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 919. [2025-03-04 10:52:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 866 states have (on average 1.3244803695150116) internal successors, (1147), 891 states have internal predecessors, (1147), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 10:52:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1197 transitions. [2025-03-04 10:52:14,732 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1197 transitions. Word has length 77 [2025-03-04 10:52:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:14,733 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1197 transitions. [2025-03-04 10:52:14,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 14.5) internal successors, (174), 13 states have internal predecessors, (174), 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-04 10:52:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1197 transitions. [2025-03-04 10:52:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 10:52:14,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:14,733 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-03-04 10:52:14,739 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-04 10:52:14,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:14,938 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:14,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash -645447216, now seen corresponding path program 1 times [2025-03-04 10:52:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:14,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342334413] [2025-03-04 10:52:14,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:14,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:14,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 10:52:14,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:52:14,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:14,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:14,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:14,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342334413] [2025-03-04 10:52:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342334413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:14,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073953989] [2025-03-04 10:52:14,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:14,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:14,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:14,982 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:14,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 10:52:15,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 10:52:15,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:52:15,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:15,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:15,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:52:15,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:15,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:15,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073953989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:15,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:15,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 10:52:15,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446052346] [2025-03-04 10:52:15,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:15,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:52:15,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:15,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:52:15,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:52:15,250 INFO L87 Difference]: Start difference. First operand 919 states and 1197 transitions. Second operand has 10 states, 9 states have (on average 17.11111111111111) internal successors, (154), 10 states have internal predecessors, (154), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:52:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:15,694 INFO L93 Difference]: Finished difference Result 1440 states and 1856 transitions. [2025-03-04 10:52:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:52:15,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 17.11111111111111) internal successors, (154), 10 states have internal predecessors, (154), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 80 [2025-03-04 10:52:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:15,698 INFO L225 Difference]: With dead ends: 1440 [2025-03-04 10:52:15,698 INFO L226 Difference]: Without dead ends: 1439 [2025-03-04 10:52:15,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:52:15,698 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 410 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:15,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 456 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:52:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-03-04 10:52:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1201. [2025-03-04 10:52:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1139 states have (on average 1.324846356453029) internal successors, (1509), 1164 states have internal predecessors, (1509), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 10:52:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1577 transitions. [2025-03-04 10:52:15,759 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1577 transitions. Word has length 80 [2025-03-04 10:52:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:15,759 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1577 transitions. [2025-03-04 10:52:15,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 17.11111111111111) internal successors, (154), 10 states have internal predecessors, (154), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:52:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1577 transitions. [2025-03-04 10:52:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 10:52:15,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:15,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:52:15,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:15,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:15,960 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:15,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2065328829, now seen corresponding path program 1 times [2025-03-04 10:52:15,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:15,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730046606] [2025-03-04 10:52:15,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:15,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 10:52:15,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:52:15,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:15,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:16,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:16,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730046606] [2025-03-04 10:52:16,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730046606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:16,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19000525] [2025-03-04 10:52:16,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:16,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:16,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:16,013 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:16,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 10:52:16,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 10:52:16,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:52:16,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:16,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:16,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:52:16,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:16,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:16,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19000525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:16,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:16,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:52:16,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953600148] [2025-03-04 10:52:16,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:16,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:52:16,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:16,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:52:16,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:52:16,175 INFO L87 Difference]: Start difference. First operand 1201 states and 1577 transitions. Second operand has 12 states, 11 states have (on average 13.636363636363637) internal successors, (150), 12 states have internal predecessors, (150), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:52:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:16,284 INFO L93 Difference]: Finished difference Result 1522 states and 1982 transitions. [2025-03-04 10:52:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:52:16,285 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 13.636363636363637) internal successors, (150), 12 states have internal predecessors, (150), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 81 [2025-03-04 10:52:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:16,288 INFO L225 Difference]: With dead ends: 1522 [2025-03-04 10:52:16,288 INFO L226 Difference]: Without dead ends: 1521 [2025-03-04 10:52:16,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:52:16,289 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 114 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:16,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 427 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:52:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-03-04 10:52:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1456. [2025-03-04 10:52:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1388 states have (on average 1.3061959654178674) internal successors, (1813), 1413 states have internal predecessors, (1813), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:52:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1893 transitions. [2025-03-04 10:52:16,351 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1893 transitions. Word has length 81 [2025-03-04 10:52:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:16,351 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 1893 transitions. [2025-03-04 10:52:16,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 13.636363636363637) internal successors, (150), 12 states have internal predecessors, (150), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:52:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1893 transitions. [2025-03-04 10:52:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 10:52:16,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:16,352 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:16,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:16,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-03-04 10:52:16,552 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:16,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:16,552 INFO L85 PathProgramCache]: Analyzing trace with hash -506111167, now seen corresponding path program 2 times [2025-03-04 10:52:16,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:16,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494665018] [2025-03-04 10:52:16,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:16,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:16,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-04 10:52:16,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 10:52:16,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:16,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1982021883] [2025-03-04 10:52:16,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:16,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:16,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:16,565 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:16,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 10:52:16,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-04 10:52:16,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 10:52:16,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:16,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:16,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:52:16,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:16,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:17,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:17,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494665018] [2025-03-04 10:52:17,219 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:17,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982021883] [2025-03-04 10:52:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982021883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:17,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-04 10:52:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248140920] [2025-03-04 10:52:17,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:17,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:52:17,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:17,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:52:17,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:52:17,222 INFO L87 Difference]: Start difference. First operand 1456 states and 1893 transitions. Second operand has 17 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 10:52:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:17,872 INFO L93 Difference]: Finished difference Result 1536 states and 1990 transitions. [2025-03-04 10:52:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:52:17,873 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 83 [2025-03-04 10:52:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:17,876 INFO L225 Difference]: With dead ends: 1536 [2025-03-04 10:52:17,876 INFO L226 Difference]: Without dead ends: 1534 [2025-03-04 10:52:17,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:52:17,877 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 474 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:17,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 670 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:52:17,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2025-03-04 10:52:17,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1477. [2025-03-04 10:52:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1410 states have (on average 1.2858156028368795) internal successors, (1813), 1434 states have internal predecessors, (1813), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:52:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1893 transitions. [2025-03-04 10:52:17,946 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1893 transitions. Word has length 83 [2025-03-04 10:52:17,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:17,946 INFO L471 AbstractCegarLoop]: Abstraction has 1477 states and 1893 transitions. [2025-03-04 10:52:17,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 10:52:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1893 transitions. [2025-03-04 10:52:17,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 10:52:17,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:17,946 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:52:17,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-04 10:52:18,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:18,147 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:18,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1624650547, now seen corresponding path program 1 times [2025-03-04 10:52:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551458851] [2025-03-04 10:52:18,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:18,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 10:52:18,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 10:52:18,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:18,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:18,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:18,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551458851] [2025-03-04 10:52:18,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551458851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:18,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282867296] [2025-03-04 10:52:18,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:18,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:18,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:18,217 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:18,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 10:52:18,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 10:52:18,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 10:52:18,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:18,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:18,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:52:18,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:18,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:18,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282867296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:18,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:18,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2025-03-04 10:52:18,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780473766] [2025-03-04 10:52:18,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:18,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:52:18,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:18,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:52:18,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:52:18,704 INFO L87 Difference]: Start difference. First operand 1477 states and 1893 transitions. Second operand has 18 states, 17 states have (on average 11.176470588235293) internal successors, (190), 18 states have internal predecessors, (190), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:52:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:19,333 INFO L93 Difference]: Finished difference Result 1594 states and 2019 transitions. [2025-03-04 10:52:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:52:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 11.176470588235293) internal successors, (190), 18 states have internal predecessors, (190), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 84 [2025-03-04 10:52:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:19,337 INFO L225 Difference]: With dead ends: 1594 [2025-03-04 10:52:19,337 INFO L226 Difference]: Without dead ends: 1593 [2025-03-04 10:52:19,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=332, Invalid=790, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:52:19,338 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 904 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:19,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 515 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:52:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2025-03-04 10:52:19,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1483. [2025-03-04 10:52:19,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1416 states have (on average 1.2817796610169492) internal successors, (1815), 1440 states have internal predecessors, (1815), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:52:19,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1895 transitions. [2025-03-04 10:52:19,414 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1895 transitions. Word has length 84 [2025-03-04 10:52:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:19,414 INFO L471 AbstractCegarLoop]: Abstraction has 1483 states and 1895 transitions. [2025-03-04 10:52:19,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 11.176470588235293) internal successors, (190), 18 states have internal predecessors, (190), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:52:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1895 transitions. [2025-03-04 10:52:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 10:52:19,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:19,415 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-03-04 10:52:19,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:19,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:19,615 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:19,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:19,616 INFO L85 PathProgramCache]: Analyzing trace with hash 387641748, now seen corresponding path program 1 times [2025-03-04 10:52:19,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:19,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893839162] [2025-03-04 10:52:19,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:19,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:52:19,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:52:19,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:19,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:19,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364208616] [2025-03-04 10:52:19,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:19,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:19,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:19,626 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:19,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 10:52:19,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:52:19,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:52:19,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:19,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:19,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:52:19,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:19,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:20,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:20,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893839162] [2025-03-04 10:52:20,062 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:20,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364208616] [2025-03-04 10:52:20,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364208616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:20,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:20,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-04 10:52:20,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235854454] [2025-03-04 10:52:20,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:20,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:52:20,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:20,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:52:20,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:52:20,063 INFO L87 Difference]: Start difference. First operand 1483 states and 1895 transitions. Second operand has 14 states, 13 states have (on average 10.0) internal successors, (130), 14 states have internal predecessors, (130), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:20,878 INFO L93 Difference]: Finished difference Result 1508 states and 1918 transitions. [2025-03-04 10:52:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:52:20,878 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.0) internal successors, (130), 14 states have internal predecessors, (130), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 85 [2025-03-04 10:52:20,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:20,881 INFO L225 Difference]: With dead ends: 1508 [2025-03-04 10:52:20,881 INFO L226 Difference]: Without dead ends: 1506 [2025-03-04 10:52:20,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:52:20,882 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 201 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:20,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 539 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:52:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-04 10:52:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1499. [2025-03-04 10:52:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1432 states have (on average 1.2793296089385475) internal successors, (1832), 1456 states have internal predecessors, (1832), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:52:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1912 transitions. [2025-03-04 10:52:20,951 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1912 transitions. Word has length 85 [2025-03-04 10:52:20,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:20,951 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1912 transitions. [2025-03-04 10:52:20,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.0) internal successors, (130), 14 states have internal predecessors, (130), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1912 transitions. [2025-03-04 10:52:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 10:52:20,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:20,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 10:52:20,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:21,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-03-04 10:52:21,153 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:21,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:21,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2078921131, now seen corresponding path program 1 times [2025-03-04 10:52:21,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:21,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191399973] [2025-03-04 10:52:21,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:21,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:52:21,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:52:21,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:21,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:21,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191399973] [2025-03-04 10:52:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191399973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284567385] [2025-03-04 10:52:21,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:21,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:21,199 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:21,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-04 10:52:21,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:52:21,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:52:21,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:21,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:21,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:52:21,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:21,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:21,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284567385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:21,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:21,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:52:21,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049670093] [2025-03-04 10:52:21,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:21,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:52:21,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:21,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:52:21,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:52:21,374 INFO L87 Difference]: Start difference. First operand 1499 states and 1912 transitions. Second operand has 12 states, 11 states have (on average 14.636363636363637) internal successors, (161), 12 states have internal predecessors, (161), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:52:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:21,540 INFO L93 Difference]: Finished difference Result 2013 states and 2544 transitions. [2025-03-04 10:52:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:52:21,540 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 14.636363636363637) internal successors, (161), 12 states have internal predecessors, (161), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 86 [2025-03-04 10:52:21,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:21,545 INFO L225 Difference]: With dead ends: 2013 [2025-03-04 10:52:21,545 INFO L226 Difference]: Without dead ends: 2012 [2025-03-04 10:52:21,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:52:21,546 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 213 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:21,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 994 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:52:21,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2025-03-04 10:52:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1805. [2025-03-04 10:52:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1729 states have (on average 1.2874493927125505) internal successors, (2226), 1753 states have internal predecessors, (2226), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-04 10:52:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2324 transitions. [2025-03-04 10:52:21,636 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2324 transitions. Word has length 86 [2025-03-04 10:52:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:21,636 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2324 transitions. [2025-03-04 10:52:21,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 14.636363636363637) internal successors, (161), 12 states have internal predecessors, (161), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:52:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2324 transitions. [2025-03-04 10:52:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 10:52:21,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:21,637 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:21,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:21,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-04 10:52:21,841 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:21,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash -177582275, now seen corresponding path program 1 times [2025-03-04 10:52:21,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:21,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804276263] [2025-03-04 10:52:21,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:21,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:21,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 10:52:21,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 10:52:21,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:21,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:21,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547007116] [2025-03-04 10:52:21,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:21,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:21,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:21,856 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:21,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-04 10:52:21,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 10:52:21,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 10:52:21,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:21,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:21,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:52:21,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:22,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:23,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:23,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804276263] [2025-03-04 10:52:23,061 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:23,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547007116] [2025-03-04 10:52:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547007116] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:23,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:23,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2025-03-04 10:52:23,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24183253] [2025-03-04 10:52:23,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:23,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:52:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:23,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:52:23,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:52:23,062 INFO L87 Difference]: Start difference. First operand 1805 states and 2324 transitions. Second operand has 23 states, 22 states have (on average 6.5) internal successors, (143), 23 states have internal predecessors, (143), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:26,149 INFO L93 Difference]: Finished difference Result 1924 states and 2458 transitions. [2025-03-04 10:52:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 10:52:26,150 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.5) internal successors, (143), 23 states have internal predecessors, (143), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 87 [2025-03-04 10:52:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:26,154 INFO L225 Difference]: With dead ends: 1924 [2025-03-04 10:52:26,154 INFO L226 Difference]: Without dead ends: 1922 [2025-03-04 10:52:26,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=548, Invalid=2314, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 10:52:26,155 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 895 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 2249 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:26,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 586 Invalid, 2294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2249 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 10:52:26,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-03-04 10:52:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1859. [2025-03-04 10:52:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1781 states have (on average 1.2801796743402583) internal successors, (2280), 1805 states have internal predecessors, (2280), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 10:52:26,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2382 transitions. [2025-03-04 10:52:26,233 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2382 transitions. Word has length 87 [2025-03-04 10:52:26,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:26,233 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2382 transitions. [2025-03-04 10:52:26,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.5) internal successors, (143), 23 states have internal predecessors, (143), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:26,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2382 transitions. [2025-03-04 10:52:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 10:52:26,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:26,234 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-03-04 10:52:26,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:26,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-04 10:52:26,434 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:26,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash -931744342, now seen corresponding path program 1 times [2025-03-04 10:52:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:26,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196759555] [2025-03-04 10:52:26,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:26,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:26,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 10:52:26,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 10:52:26,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:26,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:26,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:26,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196759555] [2025-03-04 10:52:26,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196759555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:26,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952580570] [2025-03-04 10:52:26,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:26,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:26,487 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:26,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-03-04 10:52:26,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 10:52:26,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 10:52:26,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:26,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:26,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:52:26,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:26,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:26,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952580570] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:26,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:26,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-04 10:52:26,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868796974] [2025-03-04 10:52:26,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:26,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:52:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:26,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:52:26,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:52:26,688 INFO L87 Difference]: Start difference. First operand 1859 states and 2382 transitions. Second operand has 10 states, 9 states have (on average 12.11111111111111) internal successors, (109), 10 states have internal predecessors, (109), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 10:52:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:26,939 INFO L93 Difference]: Finished difference Result 1871 states and 2394 transitions. [2025-03-04 10:52:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:52:26,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.11111111111111) internal successors, (109), 10 states have internal predecessors, (109), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 88 [2025-03-04 10:52:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:26,944 INFO L225 Difference]: With dead ends: 1871 [2025-03-04 10:52:26,944 INFO L226 Difference]: Without dead ends: 1870 [2025-03-04 10:52:26,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:52:26,945 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 140 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:26,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 314 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:52:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2025-03-04 10:52:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1859. [2025-03-04 10:52:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1781 states have (on average 1.2796181920269512) internal successors, (2279), 1805 states have internal predecessors, (2279), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 10:52:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2381 transitions. [2025-03-04 10:52:27,029 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2381 transitions. Word has length 88 [2025-03-04 10:52:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:27,029 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2381 transitions. [2025-03-04 10:52:27,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.11111111111111) internal successors, (109), 10 states have internal predecessors, (109), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 10:52:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2381 transitions. [2025-03-04 10:52:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 10:52:27,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:27,030 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:27,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-03-04 10:52:27,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:27,231 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:27,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:27,231 INFO L85 PathProgramCache]: Analyzing trace with hash 402342953, now seen corresponding path program 2 times [2025-03-04 10:52:27,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:27,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459739009] [2025-03-04 10:52:27,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:27,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:27,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-03-04 10:52:27,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:52:27,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:27,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:27,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2093838183] [2025-03-04 10:52:27,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:27,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:27,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:27,244 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:27,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-04 10:52:27,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-03-04 10:52:27,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:52:27,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:27,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:27,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:52:27,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:27,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:28,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:28,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459739009] [2025-03-04 10:52:28,035 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:28,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093838183] [2025-03-04 10:52:28,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093838183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:28,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:28,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2025-03-04 10:52:28,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881854972] [2025-03-04 10:52:28,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:28,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:52:28,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:28,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:52:28,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:52:28,037 INFO L87 Difference]: Start difference. First operand 1859 states and 2381 transitions. Second operand has 23 states, 22 states have (on average 6.818181818181818) internal successors, (150), 23 states have internal predecessors, (150), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:29,401 INFO L93 Difference]: Finished difference Result 1891 states and 2410 transitions. [2025-03-04 10:52:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 10:52:29,401 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.818181818181818) internal successors, (150), 23 states have internal predecessors, (150), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 92 [2025-03-04 10:52:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:29,404 INFO L225 Difference]: With dead ends: 1891 [2025-03-04 10:52:29,404 INFO L226 Difference]: Without dead ends: 1889 [2025-03-04 10:52:29,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=417, Invalid=1389, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 10:52:29,405 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 878 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:29,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 408 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 10:52:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2025-03-04 10:52:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1859. [2025-03-04 10:52:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1781 states have (on average 1.2773722627737227) internal successors, (2275), 1805 states have internal predecessors, (2275), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 10:52:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2377 transitions. [2025-03-04 10:52:29,478 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2377 transitions. Word has length 92 [2025-03-04 10:52:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:29,478 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2377 transitions. [2025-03-04 10:52:29,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.818181818181818) internal successors, (150), 23 states have internal predecessors, (150), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:29,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2377 transitions. [2025-03-04 10:52:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 10:52:29,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:29,478 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:29,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:29,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-04 10:52:29,679 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:29,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1260764504, now seen corresponding path program 1 times [2025-03-04 10:52:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:29,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970939601] [2025-03-04 10:52:29,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:29,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:29,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 10:52:29,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 10:52:29,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:29,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:29,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44739786] [2025-03-04 10:52:29,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:29,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:29,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:29,696 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:29,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-03-04 10:52:29,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 10:52:29,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 10:52:29,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:29,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:29,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:52:29,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:29,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:30,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970939601] [2025-03-04 10:52:30,364 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44739786] [2025-03-04 10:52:30,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44739786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:30,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:52:30,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-04 10:52:30,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811166167] [2025-03-04 10:52:30,364 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:30,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:52:30,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:30,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:52:30,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=385, Unknown=1, NotChecked=0, Total=462 [2025-03-04 10:52:30,365 INFO L87 Difference]: Start difference. First operand 1859 states and 2377 transitions. Second operand has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:30,825 INFO L93 Difference]: Finished difference Result 1891 states and 2411 transitions. [2025-03-04 10:52:30,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:52:30,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 94 [2025-03-04 10:52:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:30,829 INFO L225 Difference]: With dead ends: 1891 [2025-03-04 10:52:30,829 INFO L226 Difference]: Without dead ends: 1889 [2025-03-04 10:52:30,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=491, Unknown=1, NotChecked=0, Total=600 [2025-03-04 10:52:30,830 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 112 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:30,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 815 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:52:30,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2025-03-04 10:52:30,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1868. [2025-03-04 10:52:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1790 states have (on average 1.276536312849162) internal successors, (2285), 1814 states have internal predecessors, (2285), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 10:52:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2387 transitions. [2025-03-04 10:52:30,925 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2387 transitions. Word has length 94 [2025-03-04 10:52:30,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:30,925 INFO L471 AbstractCegarLoop]: Abstraction has 1868 states and 2387 transitions. [2025-03-04 10:52:30,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2387 transitions. [2025-03-04 10:52:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 10:52:30,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:30,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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-04 10:52:30,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-03-04 10:52:31,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2025-03-04 10:52:31,126 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:31,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:31,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1773512995, now seen corresponding path program 1 times [2025-03-04 10:52:31,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:31,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650846799] [2025-03-04 10:52:31,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:31,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:31,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 10:52:31,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 10:52:31,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:31,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:31,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:31,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650846799] [2025-03-04 10:52:31,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650846799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:31,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42094353] [2025-03-04 10:52:31,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:31,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:31,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:31,258 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:31,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-03-04 10:52:31,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 10:52:31,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 10:52:31,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:31,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:31,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:52:31,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:31,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:31,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42094353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:31,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:31,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-04 10:52:31,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328877412] [2025-03-04 10:52:31,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:31,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:52:31,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:31,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:52:31,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:52:31,691 INFO L87 Difference]: Start difference. First operand 1868 states and 2387 transitions. Second operand has 23 states, 22 states have (on average 9.818181818181818) internal successors, (216), 23 states have internal predecessors, (216), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:32,453 INFO L93 Difference]: Finished difference Result 1902 states and 2422 transitions. [2025-03-04 10:52:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:52:32,453 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.818181818181818) internal successors, (216), 23 states have internal predecessors, (216), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 94 [2025-03-04 10:52:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:32,456 INFO L225 Difference]: With dead ends: 1902 [2025-03-04 10:52:32,456 INFO L226 Difference]: Without dead ends: 1901 [2025-03-04 10:52:32,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=1319, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:52:32,458 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 224 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:32,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 663 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:52:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-03-04 10:52:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1875. [2025-03-04 10:52:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1797 states have (on average 1.2754590984974958) internal successors, (2292), 1821 states have internal predecessors, (2292), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 10:52:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2394 transitions. [2025-03-04 10:52:32,542 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2394 transitions. Word has length 94 [2025-03-04 10:52:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:32,542 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2394 transitions. [2025-03-04 10:52:32,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.818181818181818) internal successors, (216), 23 states have internal predecessors, (216), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2394 transitions. [2025-03-04 10:52:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 10:52:32,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:32,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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-04 10:52:32,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-03-04 10:52:32,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:32,743 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:32,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash -167001116, now seen corresponding path program 1 times [2025-03-04 10:52:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:32,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141466511] [2025-03-04 10:52:32,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:32,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:32,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 10:52:32,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 10:52:32,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:32,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:32,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841334818] [2025-03-04 10:52:32,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:32,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:32,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:32,758 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:32,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-03-04 10:52:32,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 10:52:32,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 10:52:32,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:32,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:32,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:52:32,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:33,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:33,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:33,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141466511] [2025-03-04 10:52:33,364 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:33,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841334818] [2025-03-04 10:52:33,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841334818] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:33,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:33,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-04 10:52:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648663722] [2025-03-04 10:52:33,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:33,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:52:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:33,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:52:33,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:52:33,365 INFO L87 Difference]: Start difference. First operand 1875 states and 2394 transitions. Second operand has 18 states, 17 states have (on average 8.705882352941176) internal successors, (148), 18 states have internal predecessors, (148), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:34,397 INFO L93 Difference]: Finished difference Result 1917 states and 2442 transitions. [2025-03-04 10:52:34,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 10:52:34,398 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 8.705882352941176) internal successors, (148), 18 states have internal predecessors, (148), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 94 [2025-03-04 10:52:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:34,400 INFO L225 Difference]: With dead ends: 1917 [2025-03-04 10:52:34,400 INFO L226 Difference]: Without dead ends: 1916 [2025-03-04 10:52:34,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:52:34,401 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 195 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:34,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 273 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:52:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-03-04 10:52:34,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1875. [2025-03-04 10:52:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1797 states have (on average 1.274902615470228) internal successors, (2291), 1821 states have internal predecessors, (2291), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 10:52:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2393 transitions. [2025-03-04 10:52:34,477 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2393 transitions. Word has length 94 [2025-03-04 10:52:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:34,477 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2393 transitions. [2025-03-04 10:52:34,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 8.705882352941176) internal successors, (148), 18 states have internal predecessors, (148), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2393 transitions. [2025-03-04 10:52:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 10:52:34,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:34,478 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:34,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:34,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-03-04 10:52:34,678 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:34,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash -428993892, now seen corresponding path program 1 times [2025-03-04 10:52:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508524219] [2025-03-04 10:52:34,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:34,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:52:34,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:34,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:34,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:34,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498445248] [2025-03-04 10:52:34,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:34,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:34,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:34,692 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:34,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-03-04 10:52:34,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:52:34,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:34,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:34,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:34,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:52:34,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:34,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508524219] [2025-03-04 10:52:35,082 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498445248] [2025-03-04 10:52:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498445248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:35,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:52:35,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 10:52:35,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556625624] [2025-03-04 10:52:35,083 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:35,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:52:35,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:35,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:52:35,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:52:35,083 INFO L87 Difference]: Start difference. First operand 1875 states and 2393 transitions. Second operand has 10 states, 9 states have (on average 9.0) internal successors, (81), 10 states have internal predecessors, (81), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:35,713 INFO L93 Difference]: Finished difference Result 2301 states and 2952 transitions. [2025-03-04 10:52:35,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:52:35,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 10 states have internal predecessors, (81), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 95 [2025-03-04 10:52:35,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:35,717 INFO L225 Difference]: With dead ends: 2301 [2025-03-04 10:52:35,717 INFO L226 Difference]: Without dead ends: 2300 [2025-03-04 10:52:35,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:52:35,718 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 191 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:35,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 659 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:52:35,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2300 states. [2025-03-04 10:52:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2300 to 2191. [2025-03-04 10:52:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2191 states, 2103 states have (on average 1.2772230147408463) internal successors, (2686), 2127 states have internal predecessors, (2686), 61 states have call successors, (61), 2 states have call predecessors, (61), 2 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 10:52:35,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 2808 transitions. [2025-03-04 10:52:35,818 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 2808 transitions. Word has length 95 [2025-03-04 10:52:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:35,818 INFO L471 AbstractCegarLoop]: Abstraction has 2191 states and 2808 transitions. [2025-03-04 10:52:35,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 10 states have internal predecessors, (81), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 2808 transitions. [2025-03-04 10:52:35,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 10:52:35,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:35,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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-04 10:52:35,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:36,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:36,019 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:36,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:36,020 INFO L85 PathProgramCache]: Analyzing trace with hash -855672029, now seen corresponding path program 1 times [2025-03-04 10:52:36,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:36,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717590409] [2025-03-04 10:52:36,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:36,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:52:36,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:36,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:36,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:52:36,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:36,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717590409] [2025-03-04 10:52:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717590409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:36,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:52:36,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:52:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332552436] [2025-03-04 10:52:36,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:36,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:52:36,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:36,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:52:36,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:52:36,053 INFO L87 Difference]: Start difference. First operand 2191 states and 2808 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:52:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:36,194 INFO L93 Difference]: Finished difference Result 2206 states and 2816 transitions. [2025-03-04 10:52:36,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:52:36,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 95 [2025-03-04 10:52:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:36,197 INFO L225 Difference]: With dead ends: 2206 [2025-03-04 10:52:36,197 INFO L226 Difference]: Without dead ends: 2183 [2025-03-04 10:52:36,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:52:36,198 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 26 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:36,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 198 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:52:36,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2025-03-04 10:52:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 2176. [2025-03-04 10:52:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 2088 states have (on average 1.2782567049808429) internal successors, (2669), 2112 states have internal predecessors, (2669), 61 states have call successors, (61), 2 states have call predecessors, (61), 2 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 10:52:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 2791 transitions. [2025-03-04 10:52:36,287 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 2791 transitions. Word has length 95 [2025-03-04 10:52:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:36,287 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 2791 transitions. [2025-03-04 10:52:36,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:52:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2791 transitions. [2025-03-04 10:52:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 10:52:36,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:36,288 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:36,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-04 10:52:36,288 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:36,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1409497060, now seen corresponding path program 2 times [2025-03-04 10:52:36,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:36,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773291265] [2025-03-04 10:52:36,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:36,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:36,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 10:52:36,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:36,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:36,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:36,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [664343474] [2025-03-04 10:52:36,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:36,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:36,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:36,298 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:36,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-03-04 10:52:36,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 10:52:36,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:36,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:36,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:36,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:52:36,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:36,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:36,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773291265] [2025-03-04 10:52:36,967 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:36,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664343474] [2025-03-04 10:52:36,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664343474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:36,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:52:36,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:52:36,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899993912] [2025-03-04 10:52:36,967 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:36,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:52:36,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:36,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:52:36,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:52:36,968 INFO L87 Difference]: Start difference. First operand 2176 states and 2791 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 9 states have internal predecessors, (81), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:37,756 INFO L93 Difference]: Finished difference Result 2197 states and 2800 transitions. [2025-03-04 10:52:37,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:52:37,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 9 states have internal predecessors, (81), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 95 [2025-03-04 10:52:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:37,759 INFO L225 Difference]: With dead ends: 2197 [2025-03-04 10:52:37,759 INFO L226 Difference]: Without dead ends: 2196 [2025-03-04 10:52:37,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:52:37,760 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 136 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:37,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 553 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:52:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2025-03-04 10:52:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2176. [2025-03-04 10:52:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 2088 states have (on average 1.2768199233716475) internal successors, (2666), 2112 states have internal predecessors, (2666), 61 states have call successors, (61), 2 states have call predecessors, (61), 2 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 10:52:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 2788 transitions. [2025-03-04 10:52:37,851 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 2788 transitions. Word has length 95 [2025-03-04 10:52:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:37,851 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 2788 transitions. [2025-03-04 10:52:37,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 9 states have internal predecessors, (81), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2788 transitions. [2025-03-04 10:52:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 10:52:37,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:37,852 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-04 10:52:37,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:38,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:38,052 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:38,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash 667946243, now seen corresponding path program 1 times [2025-03-04 10:52:38,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:38,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575442255] [2025-03-04 10:52:38,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:38,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:38,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:52:38,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:38,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:38,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:38,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1032283123] [2025-03-04 10:52:38,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:38,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:38,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:38,063 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:38,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-03-04 10:52:38,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:52:38,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:38,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:38,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:38,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:52:38,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:38,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:38,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:38,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575442255] [2025-03-04 10:52:38,724 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:38,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032283123] [2025-03-04 10:52:38,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032283123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:38,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:38,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-04 10:52:38,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519955756] [2025-03-04 10:52:38,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:38,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:52:38,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:38,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:52:38,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:52:38,725 INFO L87 Difference]: Start difference. First operand 2176 states and 2788 transitions. Second operand has 19 states, 18 states have (on average 8.777777777777779) internal successors, (158), 19 states have internal predecessors, (158), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 10:52:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:39,946 INFO L93 Difference]: Finished difference Result 2630 states and 3364 transitions. [2025-03-04 10:52:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 10:52:39,946 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 8.777777777777779) internal successors, (158), 19 states have internal predecessors, (158), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 95 [2025-03-04 10:52:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:39,950 INFO L225 Difference]: With dead ends: 2630 [2025-03-04 10:52:39,950 INFO L226 Difference]: Without dead ends: 2628 [2025-03-04 10:52:39,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 10:52:39,951 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 654 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:39,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 463 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 10:52:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2025-03-04 10:52:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2386. [2025-03-04 10:52:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2288 states have (on average 1.277097902097902) internal successors, (2922), 2312 states have internal predecessors, (2922), 71 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-04 10:52:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 3064 transitions. [2025-03-04 10:52:40,057 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 3064 transitions. Word has length 95 [2025-03-04 10:52:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:40,057 INFO L471 AbstractCegarLoop]: Abstraction has 2386 states and 3064 transitions. [2025-03-04 10:52:40,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 8.777777777777779) internal successors, (158), 19 states have internal predecessors, (158), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 10:52:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 3064 transitions. [2025-03-04 10:52:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 10:52:40,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:40,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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-04 10:52:40,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-03-04 10:52:40,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-03-04 10:52:40,259 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:40,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash -882067318, now seen corresponding path program 1 times [2025-03-04 10:52:40,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:40,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362370915] [2025-03-04 10:52:40,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:40,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:52:40,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:40,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:40,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362370915] [2025-03-04 10:52:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362370915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266962030] [2025-03-04 10:52:40,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:40,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:40,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:40,346 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:40,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-03-04 10:52:40,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:52:40,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:40,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:40,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:40,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:52:40,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:40,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:40,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266962030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:40,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:40,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-04 10:52:40,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050113963] [2025-03-04 10:52:40,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:40,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:52:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:40,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:52:40,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:52:40,710 INFO L87 Difference]: Start difference. First operand 2386 states and 3064 transitions. Second operand has 23 states, 22 states have (on average 9.954545454545455) internal successors, (219), 23 states have internal predecessors, (219), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:41,338 INFO L93 Difference]: Finished difference Result 2406 states and 3086 transitions. [2025-03-04 10:52:41,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:52:41,338 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.954545454545455) internal successors, (219), 23 states have internal predecessors, (219), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 95 [2025-03-04 10:52:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:41,341 INFO L225 Difference]: With dead ends: 2406 [2025-03-04 10:52:41,341 INFO L226 Difference]: Without dead ends: 2405 [2025-03-04 10:52:41,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:52:41,342 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 221 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:41,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 762 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:52:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2025-03-04 10:52:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2396. [2025-03-04 10:52:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2298 states have (on average 1.2771975630983463) internal successors, (2935), 2322 states have internal predecessors, (2935), 71 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-04 10:52:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3077 transitions. [2025-03-04 10:52:41,446 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3077 transitions. Word has length 95 [2025-03-04 10:52:41,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:41,446 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 3077 transitions. [2025-03-04 10:52:41,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.954545454545455) internal successors, (219), 23 states have internal predecessors, (219), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3077 transitions. [2025-03-04 10:52:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 10:52:41,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:41,447 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:41,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-03-04 10:52:41,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-03-04 10:52:41,648 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:41,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:41,648 INFO L85 PathProgramCache]: Analyzing trace with hash -413908698, now seen corresponding path program 1 times [2025-03-04 10:52:41,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:41,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009962626] [2025-03-04 10:52:41,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:41,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:41,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 10:52:41,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:52:41,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:41,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:41,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1714221504] [2025-03-04 10:52:41,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:41,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:41,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:41,662 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:41,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-03-04 10:52:41,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 10:52:41,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:52:41,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:41,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:41,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:52:41,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:41,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:42,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:42,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009962626] [2025-03-04 10:52:42,184 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:42,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714221504] [2025-03-04 10:52:42,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714221504] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:42,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:42,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-03-04 10:52:42,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292684725] [2025-03-04 10:52:42,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:42,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:52:42,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:42,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:52:42,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:52:42,185 INFO L87 Difference]: Start difference. First operand 2396 states and 3077 transitions. Second operand has 20 states, 19 states have (on average 8.0) internal successors, (152), 20 states have internal predecessors, (152), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:45,232 INFO L93 Difference]: Finished difference Result 3130 states and 4048 transitions. [2025-03-04 10:52:45,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 10:52:45,233 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 8.0) internal successors, (152), 20 states have internal predecessors, (152), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 96 [2025-03-04 10:52:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:45,237 INFO L225 Difference]: With dead ends: 3130 [2025-03-04 10:52:45,237 INFO L226 Difference]: Without dead ends: 3128 [2025-03-04 10:52:45,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=499, Invalid=3161, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 10:52:45,238 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 444 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 3189 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:45,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 955 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3189 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 10:52:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2025-03-04 10:52:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 2958. [2025-03-04 10:52:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2958 states, 2844 states have (on average 1.289732770745429) internal successors, (3668), 2868 states have internal predecessors, (3668), 87 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 10:52:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3842 transitions. [2025-03-04 10:52:45,373 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3842 transitions. Word has length 96 [2025-03-04 10:52:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:45,373 INFO L471 AbstractCegarLoop]: Abstraction has 2958 states and 3842 transitions. [2025-03-04 10:52:45,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 8.0) internal successors, (152), 20 states have internal predecessors, (152), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3842 transitions. [2025-03-04 10:52:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 10:52:45,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:45,374 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:45,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-03-04 10:52:45,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-03-04 10:52:45,575 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:45,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:45,575 INFO L85 PathProgramCache]: Analyzing trace with hash -744735834, now seen corresponding path program 2 times [2025-03-04 10:52:45,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:45,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523316652] [2025-03-04 10:52:45,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:45,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:45,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-04 10:52:45,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:52:45,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:45,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:45,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102031362] [2025-03-04 10:52:45,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:45,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:45,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:45,585 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:45,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-03-04 10:52:45,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-04 10:52:45,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:52:45,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:45,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:45,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:52:45,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:45,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:46,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:46,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523316652] [2025-03-04 10:52:46,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:46,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102031362] [2025-03-04 10:52:46,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102031362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:46,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:46,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-03-04 10:52:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997206471] [2025-03-04 10:52:46,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:46,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:52:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:46,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:52:46,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:52:46,103 INFO L87 Difference]: Start difference. First operand 2958 states and 3842 transitions. Second operand has 20 states, 19 states have (on average 8.0) internal successors, (152), 20 states have internal predecessors, (152), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:47,927 INFO L93 Difference]: Finished difference Result 3149 states and 4076 transitions. [2025-03-04 10:52:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 10:52:47,928 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 8.0) internal successors, (152), 20 states have internal predecessors, (152), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 96 [2025-03-04 10:52:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:47,931 INFO L225 Difference]: With dead ends: 3149 [2025-03-04 10:52:47,931 INFO L226 Difference]: Without dead ends: 3147 [2025-03-04 10:52:47,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=548, Invalid=2532, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 10:52:47,933 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 665 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:47,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 544 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 10:52:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2025-03-04 10:52:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 2962. [2025-03-04 10:52:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2962 states, 2848 states have (on average 1.2865168539325842) internal successors, (3664), 2872 states have internal predecessors, (3664), 87 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 10:52:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 3838 transitions. [2025-03-04 10:52:48,070 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 3838 transitions. Word has length 96 [2025-03-04 10:52:48,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:48,070 INFO L471 AbstractCegarLoop]: Abstraction has 2962 states and 3838 transitions. [2025-03-04 10:52:48,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 8.0) internal successors, (152), 20 states have internal predecessors, (152), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 3838 transitions. [2025-03-04 10:52:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 10:52:48,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:48,071 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:48,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:48,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:48,271 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:48,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:48,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2001636863, now seen corresponding path program 2 times [2025-03-04 10:52:48,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:48,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919330604] [2025-03-04 10:52:48,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:48,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-04 10:52:48,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:52:48,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:48,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:48,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1669138778] [2025-03-04 10:52:48,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:48,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:48,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:48,283 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:48,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-03-04 10:52:48,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-04 10:52:48,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:52:48,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:48,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:48,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:52:48,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:48,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:48,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:48,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919330604] [2025-03-04 10:52:48,645 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:48,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669138778] [2025-03-04 10:52:48,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669138778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:48,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:52:48,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-04 10:52:48,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866792344] [2025-03-04 10:52:48,646 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:48,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:52:48,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:48,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:52:48,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:52:48,646 INFO L87 Difference]: Start difference. First operand 2962 states and 3838 transitions. Second operand has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:49,325 INFO L93 Difference]: Finished difference Result 3005 states and 3857 transitions. [2025-03-04 10:52:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 10:52:49,325 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 99 [2025-03-04 10:52:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:49,328 INFO L225 Difference]: With dead ends: 3005 [2025-03-04 10:52:49,328 INFO L226 Difference]: Without dead ends: 3003 [2025-03-04 10:52:49,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:52:49,329 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 223 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:49,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 855 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:52:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2025-03-04 10:52:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2962. [2025-03-04 10:52:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2962 states, 2848 states have (on average 1.276685393258427) internal successors, (3636), 2872 states have internal predecessors, (3636), 87 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 10:52:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 3810 transitions. [2025-03-04 10:52:49,462 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 3810 transitions. Word has length 99 [2025-03-04 10:52:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:49,462 INFO L471 AbstractCegarLoop]: Abstraction has 2962 states and 3810 transitions. [2025-03-04 10:52:49,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 3810 transitions. [2025-03-04 10:52:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 10:52:49,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:49,462 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-03-04 10:52:49,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:49,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:49,663 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:49,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:49,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1574958726, now seen corresponding path program 1 times [2025-03-04 10:52:49,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:49,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575846050] [2025-03-04 10:52:49,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:49,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:49,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 10:52:49,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:52:49,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:49,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:49,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240166564] [2025-03-04 10:52:49,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:49,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:49,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:49,673 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:49,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-03-04 10:52:49,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 10:52:49,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:52:49,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:49,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:49,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:52:49,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:50,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:51,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:51,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575846050] [2025-03-04 10:52:51,092 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:51,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240166564] [2025-03-04 10:52:51,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240166564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:51,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:51,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2025-03-04 10:52:51,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253089256] [2025-03-04 10:52:51,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:51,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:52:51,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:51,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:52:51,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:52:51,093 INFO L87 Difference]: Start difference. First operand 2962 states and 3810 transitions. Second operand has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 25 states have internal predecessors, (158), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:53,703 INFO L93 Difference]: Finished difference Result 2980 states and 3833 transitions. [2025-03-04 10:52:53,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 10:52:53,703 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 25 states have internal predecessors, (158), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 99 [2025-03-04 10:52:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:53,706 INFO L225 Difference]: With dead ends: 2980 [2025-03-04 10:52:53,706 INFO L226 Difference]: Without dead ends: 2956 [2025-03-04 10:52:53,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=378, Invalid=954, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 10:52:53,707 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 156 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:53,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 315 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 10:52:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2025-03-04 10:52:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2953. [2025-03-04 10:52:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2839 states have (on average 1.2789714688270517) internal successors, (3631), 2863 states have internal predecessors, (3631), 87 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 10:52:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3805 transitions. [2025-03-04 10:52:53,846 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3805 transitions. Word has length 99 [2025-03-04 10:52:53,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:53,846 INFO L471 AbstractCegarLoop]: Abstraction has 2953 states and 3805 transitions. [2025-03-04 10:52:53,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 25 states have internal predecessors, (158), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3805 transitions. [2025-03-04 10:52:53,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 10:52:53,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:53,847 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:53,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:54,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:54,047 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:54,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash -625470506, now seen corresponding path program 1 times [2025-03-04 10:52:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62123658] [2025-03-04 10:52:54,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:54,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:54,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 10:52:54,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 10:52:54,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:54,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:54,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242443605] [2025-03-04 10:52:54,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:54,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:54,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:54,060 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:54,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-03-04 10:52:54,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 10:52:54,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 10:52:54,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:54,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:54,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 10:52:54,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:54,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:56,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62123658] [2025-03-04 10:52:56,457 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242443605] [2025-03-04 10:52:56,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242443605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:56,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:52:56,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-03-04 10:52:56,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065805178] [2025-03-04 10:52:56,457 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:56,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:52:56,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:56,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:52:56,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:52:56,458 INFO L87 Difference]: Start difference. First operand 2953 states and 3805 transitions. Second operand has 15 states, 14 states have (on average 6.428571428571429) internal successors, (90), 15 states have internal predecessors, (90), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:52:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:57,737 INFO L93 Difference]: Finished difference Result 2957 states and 3808 transitions. [2025-03-04 10:52:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:52:57,738 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.428571428571429) internal successors, (90), 15 states have internal predecessors, (90), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 101 [2025-03-04 10:52:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:57,741 INFO L225 Difference]: With dead ends: 2957 [2025-03-04 10:52:57,741 INFO L226 Difference]: Without dead ends: 2956 [2025-03-04 10:52:57,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:52:57,742 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 226 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:57,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 379 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:52:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2025-03-04 10:52:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2953. [2025-03-04 10:52:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2839 states have (on average 1.2786192321239873) internal successors, (3630), 2863 states have internal predecessors, (3630), 87 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 10:52:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3804 transitions. [2025-03-04 10:52:57,887 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3804 transitions. Word has length 101 [2025-03-04 10:52:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:57,889 INFO L471 AbstractCegarLoop]: Abstraction has 2953 states and 3804 transitions. [2025-03-04 10:52:57,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.428571428571429) internal successors, (90), 15 states have internal predecessors, (90), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:52:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3804 transitions. [2025-03-04 10:52:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 10:52:57,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:57,890 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:57,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2025-03-04 10:52:58,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2025-03-04 10:52:58,091 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:58,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash 817973140, now seen corresponding path program 1 times [2025-03-04 10:52:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:58,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374481176] [2025-03-04 10:52:58,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:58,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 10:52:58,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:52:58,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:58,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:58,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821411485] [2025-03-04 10:52:58,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:58,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:58,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:58,102 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:58,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-03-04 10:52:58,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 10:52:58,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:52:58,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:58,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:58,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:52:58,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:58,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 10:52:58,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:58,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374481176] [2025-03-04 10:52:58,727 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:58,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821411485] [2025-03-04 10:52:58,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821411485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:58,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:58,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 [2025-03-04 10:52:58,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459605271] [2025-03-04 10:52:58,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:58,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:52:58,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:58,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:52:58,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:52:58,728 INFO L87 Difference]: Start difference. First operand 2953 states and 3804 transitions. Second operand has 18 states, 17 states have (on average 8.411764705882353) internal successors, (143), 18 states have internal predecessors, (143), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 10:53:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:01,481 INFO L93 Difference]: Finished difference Result 2968 states and 3821 transitions. [2025-03-04 10:53:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 10:53:01,481 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 8.411764705882353) internal successors, (143), 18 states have internal predecessors, (143), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 103 [2025-03-04 10:53:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:01,485 INFO L225 Difference]: With dead ends: 2968 [2025-03-04 10:53:01,485 INFO L226 Difference]: Without dead ends: 2966 [2025-03-04 10:53:01,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:53:01,486 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 320 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:01,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 244 Invalid, 2194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 10:53:01,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2025-03-04 10:53:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2952. [2025-03-04 10:53:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2952 states, 2839 states have (on average 1.250792532581895) internal successors, (3551), 2862 states have internal predecessors, (3551), 87 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 10:53:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3725 transitions. [2025-03-04 10:53:01,636 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3725 transitions. Word has length 103 [2025-03-04 10:53:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:01,637 INFO L471 AbstractCegarLoop]: Abstraction has 2952 states and 3725 transitions. [2025-03-04 10:53:01,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 8.411764705882353) internal successors, (143), 18 states have internal predecessors, (143), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 10:53:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3725 transitions. [2025-03-04 10:53:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 10:53:01,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:01,637 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:01,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:01,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2025-03-04 10:53:01,838 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:53:01,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash 956867449, now seen corresponding path program 1 times [2025-03-04 10:53:01,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:01,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508536183] [2025-03-04 10:53:01,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:01,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:01,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 10:53:01,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 10:53:01,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:01,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:01,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1066282732] [2025-03-04 10:53:01,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:01,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:01,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:01,849 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:01,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-03-04 10:53:01,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 10:53:01,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 10:53:01,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:01,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:01,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 10:53:01,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:53:02,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:53:04,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508536183] [2025-03-04 10:53:04,746 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066282732] [2025-03-04 10:53:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066282732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:04,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2025-03-04 10:53:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442738354] [2025-03-04 10:53:04,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:04,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:53:04,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:04,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:53:04,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=859, Unknown=1, NotChecked=0, Total=992 [2025-03-04 10:53:04,747 INFO L87 Difference]: Start difference. First operand 2952 states and 3725 transitions. Second operand has 32 states, 31 states have (on average 5.741935483870968) internal successors, (178), 32 states have internal predecessors, (178), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 10:53:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:09,982 INFO L93 Difference]: Finished difference Result 3161 states and 3980 transitions. [2025-03-04 10:53:09,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-04 10:53:09,982 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.741935483870968) internal successors, (178), 32 states have internal predecessors, (178), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 105 [2025-03-04 10:53:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:09,985 INFO L225 Difference]: With dead ends: 3161 [2025-03-04 10:53:09,985 INFO L226 Difference]: Without dead ends: 3158 [2025-03-04 10:53:09,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1147, Invalid=6862, Unknown=1, NotChecked=0, Total=8010 [2025-03-04 10:53:09,987 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1073 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 3484 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 3539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:09,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 469 Invalid, 3539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3484 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 10:53:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3158 states. [2025-03-04 10:53:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3158 to 3024. [2025-03-04 10:53:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3024 states, 2910 states have (on average 1.249828178694158) internal successors, (3637), 2933 states have internal predecessors, (3637), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 10:53:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 3813 transitions. [2025-03-04 10:53:10,146 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 3813 transitions. Word has length 105 [2025-03-04 10:53:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:10,146 INFO L471 AbstractCegarLoop]: Abstraction has 3024 states and 3813 transitions. [2025-03-04 10:53:10,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 5.741935483870968) internal successors, (178), 32 states have internal predecessors, (178), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 10:53:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 3813 transitions. [2025-03-04 10:53:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 10:53:10,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:10,147 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:10,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:10,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:10,348 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:53:10,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash -163809945, now seen corresponding path program 1 times [2025-03-04 10:53:10,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:10,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407879150] [2025-03-04 10:53:10,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:10,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 10:53:10,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 10:53:10,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:53:10,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:10,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407879150] [2025-03-04 10:53:10,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407879150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:10,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34769087] [2025-03-04 10:53:10,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:10,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:10,445 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:10,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-03-04 10:53:10,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 10:53:10,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 10:53:10,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:10,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:53:10,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:53:10,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:53:10,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34769087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:10,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:10,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-03-04 10:53:10,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096957471] [2025-03-04 10:53:10,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:10,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:53:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:10,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:53:10,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:53:10,925 INFO L87 Difference]: Start difference. First operand 3024 states and 3813 transitions. Second operand has 23 states, 23 states have (on average 9.73913043478261) internal successors, (224), 23 states have internal predecessors, (224), 9 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-04 10:53:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:11,519 INFO L93 Difference]: Finished difference Result 3073 states and 3863 transitions. [2025-03-04 10:53:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:53:11,520 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.73913043478261) internal successors, (224), 23 states have internal predecessors, (224), 9 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 117 [2025-03-04 10:53:11,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:11,523 INFO L225 Difference]: With dead ends: 3073 [2025-03-04 10:53:11,523 INFO L226 Difference]: Without dead ends: 3005 [2025-03-04 10:53:11,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=935, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:53:11,524 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 94 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:11,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 689 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2025-03-04 10:53:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 3004. [2025-03-04 10:53:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 2890 states have (on average 1.24878892733564) internal successors, (3609), 2913 states have internal predecessors, (3609), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 10:53:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3785 transitions. [2025-03-04 10:53:11,678 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3785 transitions. Word has length 117 [2025-03-04 10:53:11,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:11,678 INFO L471 AbstractCegarLoop]: Abstraction has 3004 states and 3785 transitions. [2025-03-04 10:53:11,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.73913043478261) internal successors, (224), 23 states have internal predecessors, (224), 9 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-04 10:53:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3785 transitions. [2025-03-04 10:53:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 10:53:11,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:11,679 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:11,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-03-04 10:53:11,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2025-03-04 10:53:11,880 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:53:11,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash -959491591, now seen corresponding path program 1 times [2025-03-04 10:53:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:11,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269310041] [2025-03-04 10:53:11,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:11,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 10:53:11,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 10:53:11,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:11,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:53:12,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:12,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269310041] [2025-03-04 10:53:12,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269310041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:12,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389830100] [2025-03-04 10:53:12,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:12,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:12,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:12,049 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:12,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-03-04 10:53:12,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 10:53:12,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 10:53:12,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:12,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:12,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:53:12,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:53:12,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:53:12,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389830100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:12,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:12,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-03-04 10:53:12,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934089598] [2025-03-04 10:53:12,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:12,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:53:12,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:12,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:53:12,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:53:12,686 INFO L87 Difference]: Start difference. First operand 3004 states and 3785 transitions. Second operand has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 26 states have internal predecessors, (255), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-04 10:53:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:13,653 INFO L93 Difference]: Finished difference Result 3038 states and 3817 transitions. [2025-03-04 10:53:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:53:13,654 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 26 states have internal predecessors, (255), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 118 [2025-03-04 10:53:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:13,656 INFO L225 Difference]: With dead ends: 3038 [2025-03-04 10:53:13,656 INFO L226 Difference]: Without dead ends: 2987 [2025-03-04 10:53:13,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=262, Invalid=1718, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 10:53:13,657 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 157 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:13,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 639 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2025-03-04 10:53:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2986. [2025-03-04 10:53:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2872 states have (on average 1.248259052924791) internal successors, (3585), 2895 states have internal predecessors, (3585), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 10:53:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 3761 transitions. [2025-03-04 10:53:13,799 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 3761 transitions. Word has length 118 [2025-03-04 10:53:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:13,799 INFO L471 AbstractCegarLoop]: Abstraction has 2986 states and 3761 transitions. [2025-03-04 10:53:13,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 26 states have internal predecessors, (255), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-04 10:53:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 3761 transitions. [2025-03-04 10:53:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 10:53:13,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:13,800 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:13,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-03-04 10:53:14,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-03-04 10:53:14,001 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:53:14,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:14,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2024905910, now seen corresponding path program 1 times [2025-03-04 10:53:14,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:14,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306744279] [2025-03-04 10:53:14,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:14,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:14,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 10:53:14,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 10:53:14,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:14,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:14,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1290602330] [2025-03-04 10:53:14,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:14,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:14,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:14,012 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:14,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-03-04 10:53:14,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 10:53:14,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 10:53:14,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:14,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:14,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 10:53:14,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:53:14,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:53:14,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:14,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306744279] [2025-03-04 10:53:14,947 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:14,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290602330] [2025-03-04 10:53:14,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290602330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:14,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:14,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2025-03-04 10:53:14,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093627130] [2025-03-04 10:53:14,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:14,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:53:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:14,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:53:14,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:53:14,948 INFO L87 Difference]: Start difference. First operand 2986 states and 3761 transitions. Second operand has 28 states, 27 states have (on average 7.185185185185185) internal successors, (194), 28 states have internal predecessors, (194), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:53:18,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:18,056 INFO L93 Difference]: Finished difference Result 3036 states and 3814 transitions. [2025-03-04 10:53:18,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 10:53:18,057 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 7.185185185185185) internal successors, (194), 28 states have internal predecessors, (194), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 122 [2025-03-04 10:53:18,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:18,059 INFO L225 Difference]: With dead ends: 3036 [2025-03-04 10:53:18,059 INFO L226 Difference]: Without dead ends: 3035 [2025-03-04 10:53:18,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=729, Invalid=4383, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 10:53:18,060 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 363 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 2736 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:18,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 709 Invalid, 2777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2736 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 10:53:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2025-03-04 10:53:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 3004. [2025-03-04 10:53:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 2890 states have (on average 1.2477508650519031) internal successors, (3606), 2913 states have internal predecessors, (3606), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 10:53:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3782 transitions. [2025-03-04 10:53:18,223 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3782 transitions. Word has length 122 [2025-03-04 10:53:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:18,223 INFO L471 AbstractCegarLoop]: Abstraction has 3004 states and 3782 transitions. [2025-03-04 10:53:18,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 7.185185185185185) internal successors, (194), 28 states have internal predecessors, (194), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:53:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3782 transitions. [2025-03-04 10:53:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 10:53:18,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:18,224 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:18,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-03-04 10:53:18,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:18,424 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:53:18,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:18,425 INFO L85 PathProgramCache]: Analyzing trace with hash 944004149, now seen corresponding path program 2 times [2025-03-04 10:53:18,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:18,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957540825] [2025-03-04 10:53:18,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:18,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 126 statements into 2 equivalence classes. [2025-03-04 10:53:18,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 10:53:18,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:18,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:18,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605499438] [2025-03-04 10:53:18,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:18,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:18,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:18,441 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:18,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-03-04 10:53:18,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 126 statements into 2 equivalence classes. [2025-03-04 10:53:18,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 10:53:18,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:18,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:18,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:53:18,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 77 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:53:18,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:18,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:18,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957540825] [2025-03-04 10:53:18,912 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:18,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605499438] [2025-03-04 10:53:18,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605499438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:18,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:18,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-03-04 10:53:18,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996353845] [2025-03-04 10:53:18,912 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:18,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:53:18,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:18,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:53:18,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:53:18,913 INFO L87 Difference]: Start difference. First operand 3004 states and 3782 transitions. Second operand has 14 states, 13 states have (on average 8.23076923076923) internal successors, (107), 14 states have internal predecessors, (107), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 10:53:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:19,843 INFO L93 Difference]: Finished difference Result 3535 states and 4452 transitions. [2025-03-04 10:53:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 10:53:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.23076923076923) internal successors, (107), 14 states have internal predecessors, (107), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 126 [2025-03-04 10:53:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:19,846 INFO L225 Difference]: With dead ends: 3535 [2025-03-04 10:53:19,846 INFO L226 Difference]: Without dead ends: 3533 [2025-03-04 10:53:19,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:53:19,846 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 201 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:19,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1073 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:53:19,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3533 states. [2025-03-04 10:53:20,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3533 to 3287. [2025-03-04 10:53:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 3165 states have (on average 1.2372827804107425) internal successors, (3916), 3188 states have internal predecessors, (3916), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 10:53:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 4108 transitions. [2025-03-04 10:53:20,028 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 4108 transitions. Word has length 126 [2025-03-04 10:53:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:20,028 INFO L471 AbstractCegarLoop]: Abstraction has 3287 states and 4108 transitions. [2025-03-04 10:53:20,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.23076923076923) internal successors, (107), 14 states have internal predecessors, (107), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 10:53:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 4108 transitions. [2025-03-04 10:53:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 10:53:20,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:20,029 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:20,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-03-04 10:53:20,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:20,230 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:53:20,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:20,230 INFO L85 PathProgramCache]: Analyzing trace with hash -750192971, now seen corresponding path program 3 times [2025-03-04 10:53:20,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:20,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313032537] [2025-03-04 10:53:20,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:53:20,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:20,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 126 statements into 4 equivalence classes. [2025-03-04 10:53:20,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 10:53:20,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 10:53:20,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:20,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759463900] [2025-03-04 10:53:20,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:53:20,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:20,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:20,243 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:20,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-03-04 10:53:20,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 126 statements into 4 equivalence classes. [2025-03-04 10:53:20,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 58 of 126 statements. [2025-03-04 10:53:20,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:53:20,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:20,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:53:20,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 10:53:21,439 INFO L312 TraceCheckSpWp]: Computing backward predicates...