./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 172ac4fa0310d14c59d9149bc1b8ec1548860e0b827250d611bfd9d710019753 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:30:37,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:30:37,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:30:37,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:30:37,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:30:37,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:30:37,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:30:37,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:30:37,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:30:37,513 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:30:37,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:30:37,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:30:37,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:30:37,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:30:37,514 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:30:37,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:30:37,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:30:37,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:30:37,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:30:37,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:30:37,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:30:37,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:30:37,515 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:30:37,515 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:30:37,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:30:37,515 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:30:37,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:30:37,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:30:37,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:30:37,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:30:37,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:30:37,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:30:37,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:30:37,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:30:37,516 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:30:37,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:30:37,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:30:37,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:30:37,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:30:37,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:30:37,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:30:37,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:30:37,516 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 172ac4fa0310d14c59d9149bc1b8ec1548860e0b827250d611bfd9d710019753 [2025-03-04 10:30:37,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:30:37,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:30:37,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:30:37,758 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:30:37,759 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:30:37,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a.c [2025-03-04 10:30:38,906 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb91e487/de34f211c4d04491b013117a3d5a66b7/FLAG302d10290 [2025-03-04 10:30:39,099 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:30:39,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig9a.c [2025-03-04 10:30:39,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb91e487/de34f211c4d04491b013117a3d5a66b7/FLAG302d10290 [2025-03-04 10:30:39,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb91e487/de34f211c4d04491b013117a3d5a66b7 [2025-03-04 10:30:39,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:30:39,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:30:39,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:30:39,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:30:39,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:30:39,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:30:39" (1/1) ... [2025-03-04 10:30:39,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39, skipping insertion in model container [2025-03-04 10:30:39,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:30:39" (1/1) ... [2025-03-04 10:30:39,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:30:39,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:30:39,591 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:30:39,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:30:39,609 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:30:39,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39 WrapperNode [2025-03-04 10:30:39,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:30:39,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:30:39,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:30:39,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:30:39,617 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:30:39" (1/1) ... [2025-03-04 10:30:39,620 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:30:39" (1/1) ... [2025-03-04 10:30:39,629 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2025-03-04 10:30:39,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:30:39,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:30:39,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:30:39,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:30:39,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39" (1/1) ... [2025-03-04 10:30:39,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39" (1/1) ... [2025-03-04 10:30:39,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39" (1/1) ... [2025-03-04 10:30:39,643 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:30:39,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39" (1/1) ... [2025-03-04 10:30:39,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39" (1/1) ... [2025-03-04 10:30:39,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39" (1/1) ... [2025-03-04 10:30:39,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39" (1/1) ... [2025-03-04 10:30:39,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39" (1/1) ... [2025-03-04 10:30:39,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39" (1/1) ... [2025-03-04 10:30:39,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:30:39,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:30:39,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:30:39,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:30:39,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39" (1/1) ... [2025-03-04 10:30:39,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:30:39,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:39,681 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:30:39,684 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:30:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:30:39,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:30:39,752 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:30:39,753 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:30:39,836 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 10:30:39,837 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:30:39,843 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:30:39,845 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:30:39,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:30:39 BoogieIcfgContainer [2025-03-04 10:30:39,845 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:30:39,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:30:39,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:30:39,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:30:39,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:30:39" (1/3) ... [2025-03-04 10:30:39,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2bb650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:30:39, skipping insertion in model container [2025-03-04 10:30:39,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:30:39" (2/3) ... [2025-03-04 10:30:39,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2bb650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:30:39, skipping insertion in model container [2025-03-04 10:30:39,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:30:39" (3/3) ... [2025-03-04 10:30:39,857 INFO L128 eAbstractionObserver]: Analyzing ICFG BrockschmidtCookFuhs-CAV2013-Fig9a.c [2025-03-04 10:30:39,869 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:30:39,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG BrockschmidtCookFuhs-CAV2013-Fig9a.c that has 1 procedures, 17 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-04 10:30:39,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:30:39,917 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;@65d12a09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:30:39,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:30:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:30:39,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:39,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:30:39,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:39,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:39,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1418987965, now seen corresponding path program 1 times [2025-03-04 10:30:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:39,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384673895] [2025-03-04 10:30:39,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:39,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:30:40,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:30:40,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:40,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:40,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:40,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384673895] [2025-03-04 10:30:40,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384673895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:30:40,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:30:40,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:30:40,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286680735] [2025-03-04 10:30:40,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:30:40,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:30:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:40,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:30:40,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:30:40,129 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:40,191 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2025-03-04 10:30:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:30:40,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:30:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:40,200 INFO L225 Difference]: With dead ends: 19 [2025-03-04 10:30:40,200 INFO L226 Difference]: Without dead ends: 12 [2025-03-04 10:30:40,202 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:30:40,205 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:40,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-04 10:30:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-04 10:30:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2025-03-04 10:30:40,234 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 6 [2025-03-04 10:30:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:40,234 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-03-04 10:30:40,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2025-03-04 10:30:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:30:40,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:40,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:30:40,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:30:40,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:40,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:40,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1418987992, now seen corresponding path program 1 times [2025-03-04 10:30:40,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:40,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793927515] [2025-03-04 10:30:40,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:40,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:40,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:30:40,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:30:40,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:40,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:40,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:40,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793927515] [2025-03-04 10:30:40,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793927515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:30:40,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:30:40,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:30:40,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789963271] [2025-03-04 10:30:40,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:30:40,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:30:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:40,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:30:40,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:30:40,298 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:40,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:40,332 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2025-03-04 10:30:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:30:40,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:30:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:40,333 INFO L225 Difference]: With dead ends: 21 [2025-03-04 10:30:40,333 INFO L226 Difference]: Without dead ends: 12 [2025-03-04 10:30:40,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:30:40,334 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:40,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 7 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-04 10:30:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-04 10:30:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2025-03-04 10:30:40,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 6 [2025-03-04 10:30:40,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:40,341 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-03-04 10:30:40,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2025-03-04 10:30:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:30:40,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:40,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:40,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:30:40,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:40,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1038953932, now seen corresponding path program 1 times [2025-03-04 10:30:40,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:40,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427813495] [2025-03-04 10:30:40,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:40,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:30:40,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:30:40,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:40,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:40,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:40,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427813495] [2025-03-04 10:30:40,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427813495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:30:40,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:30:40,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:30:40,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455054877] [2025-03-04 10:30:40,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:30:40,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:30:40,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:40,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:30:40,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:30:40,401 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:40,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:40,421 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2025-03-04 10:30:40,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:30:40,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:30:40,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:40,422 INFO L225 Difference]: With dead ends: 15 [2025-03-04 10:30:40,422 INFO L226 Difference]: Without dead ends: 14 [2025-03-04 10:30:40,422 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:30:40,423 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:40,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:30:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-04 10:30:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-04 10:30:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-03-04 10:30:40,431 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 7 [2025-03-04 10:30:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:40,431 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-04 10:30:40,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-03-04 10:30:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:30:40,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:40,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:40,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:30:40,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:40,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1942234303, now seen corresponding path program 1 times [2025-03-04 10:30:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139978282] [2025-03-04 10:30:40,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:40,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:30:40,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:30:40,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:40,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:40,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:40,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139978282] [2025-03-04 10:30:40,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139978282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:40,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583054054] [2025-03-04 10:30:40,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:40,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:40,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:40,499 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:30:40,501 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:30:40,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:30:40,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:30:40,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:40,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:40,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:30:40,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:40,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:30:40,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583054054] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:40,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:40,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 10:30:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969945001] [2025-03-04 10:30:40,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:40,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:30:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:40,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:30:40,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:30:40,653 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:40,736 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-03-04 10:30:40,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:30:40,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 10:30:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:40,736 INFO L225 Difference]: With dead ends: 32 [2025-03-04 10:30:40,737 INFO L226 Difference]: Without dead ends: 21 [2025-03-04 10:30:40,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:30:40,737 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:40,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 12 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:30:40,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-04 10:30:40,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-04 10:30:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-03-04 10:30:40,746 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 10 [2025-03-04 10:30:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:40,746 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-04 10:30:40,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-03-04 10:30:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:30:40,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:40,746 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:40,753 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:30:40,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:40,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:40,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash 299247823, now seen corresponding path program 1 times [2025-03-04 10:30:40,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:40,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960640241] [2025-03-04 10:30:40,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:40,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:40,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:30:40,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:30:40,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:40,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:41,057 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:30:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:41,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960640241] [2025-03-04 10:30:41,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960640241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:41,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303374647] [2025-03-04 10:30:41,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:30:41,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:41,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:41,061 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:30:41,062 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:30:41,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:30:41,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:30:41,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:41,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:41,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:30:41,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:41,171 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:30:41,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:41,244 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:30:41,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303374647] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:41,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:41,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 10:30:41,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404365281] [2025-03-04 10:30:41,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:41,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:30:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:41,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:30:41,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:30:41,245 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:41,508 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2025-03-04 10:30:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:30:41,508 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 10:30:41,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:41,509 INFO L225 Difference]: With dead ends: 67 [2025-03-04 10:30:41,509 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 10:30:41,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:30:41,510 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:41,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 25 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:30:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 10:30:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2025-03-04 10:30:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2025-03-04 10:30:41,518 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 17 [2025-03-04 10:30:41,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:41,518 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2025-03-04 10:30:41,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2025-03-04 10:30:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:30:41,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:41,519 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:30:41,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:30:41,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:41,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:41,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1998803375, now seen corresponding path program 2 times [2025-03-04 10:30:41,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:41,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021319927] [2025-03-04 10:30:41,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:30:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:41,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:30:41,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:30:41,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:30:41,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:30:41,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:41,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021319927] [2025-03-04 10:30:41,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021319927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:41,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262808178] [2025-03-04 10:30:41,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:30:41,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:41,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:41,867 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:30:41,868 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:30:41,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:30:41,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:30:41,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:30:41,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:41,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:30:41,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:30:42,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:30:42,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262808178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:42,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:42,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-03-04 10:30:42,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438103855] [2025-03-04 10:30:42,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:42,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:30:42,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:42,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:30:42,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:30:42,140 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:42,711 INFO L93 Difference]: Finished difference Result 187 states and 246 transitions. [2025-03-04 10:30:42,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 10:30:42,711 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 10:30:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:42,714 INFO L225 Difference]: With dead ends: 187 [2025-03-04 10:30:42,715 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 10:30:42,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=449, Invalid=1443, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 10:30:42,716 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:42,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 26 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:30:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 10:30:42,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 64. [2025-03-04 10:30:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 63 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2025-03-04 10:30:42,735 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 23 [2025-03-04 10:30:42,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:42,736 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2025-03-04 10:30:42,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:42,736 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2025-03-04 10:30:42,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:30:42,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:42,737 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 10:30:42,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:30:42,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:42,938 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:42,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1085292735, now seen corresponding path program 3 times [2025-03-04 10:30:42,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:42,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578689417] [2025-03-04 10:30:42,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:30:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:42,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 8 equivalence classes. [2025-03-04 10:30:42,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 35 of 38 statements. [2025-03-04 10:30:42,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 10:30:42,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:30:43,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:43,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578689417] [2025-03-04 10:30:43,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578689417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:43,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874799658] [2025-03-04 10:30:43,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:30:43,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:43,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:43,065 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:30:43,067 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:30:43,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 8 equivalence classes. [2025-03-04 10:30:43,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 35 of 38 statements. [2025-03-04 10:30:43,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 10:30:43,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:43,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:30:43,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:30:43,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:30:43,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874799658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:43,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:43,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-04 10:30:43,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640936404] [2025-03-04 10:30:43,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:43,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:30:43,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:43,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:30:43,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:30:43,301 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 21 states, 20 states have (on average 4.05) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:43,898 INFO L93 Difference]: Finished difference Result 573 states and 696 transitions. [2025-03-04 10:30:43,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-04 10:30:43,898 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.05) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-04 10:30:43,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:43,900 INFO L225 Difference]: With dead ends: 573 [2025-03-04 10:30:43,900 INFO L226 Difference]: Without dead ends: 571 [2025-03-04 10:30:43,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=904, Invalid=2636, Unknown=0, NotChecked=0, Total=3540 [2025-03-04 10:30:43,906 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:43,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 28 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:30:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-04 10:30:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 348. [2025-03-04 10:30:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 346 states have (on average 1.2254335260115607) internal successors, (424), 347 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 424 transitions. [2025-03-04 10:30:43,953 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 424 transitions. Word has length 38 [2025-03-04 10:30:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:43,953 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 424 transitions. [2025-03-04 10:30:43,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.05) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 424 transitions. [2025-03-04 10:30:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 10:30:43,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:43,954 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 10:30:43,960 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:30:44,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:44,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:44,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash -509102689, now seen corresponding path program 4 times [2025-03-04 10:30:44,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:44,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037444719] [2025-03-04 10:30:44,156 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:30:44,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:44,160 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:30:44,166 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:30:44,167 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:30:44,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 127 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:30:44,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:44,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037444719] [2025-03-04 10:30:44,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037444719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:44,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773219330] [2025-03-04 10:30:44,340 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:30:44,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:44,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:44,342 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:30:44,343 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:30:44,362 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:30:44,373 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:30:44,373 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:30:44,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:44,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:30:44,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 92 proven. 47 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:30:44,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 65 proven. 74 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:30:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773219330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:44,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:44,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 35 [2025-03-04 10:30:44,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307627952] [2025-03-04 10:30:44,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:44,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 10:30:44,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:44,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 10:30:44,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 10:30:44,780 INFO L87 Difference]: Start difference. First operand 348 states and 424 transitions. Second operand has 35 states, 35 states have (on average 3.2) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:45,947 INFO L93 Difference]: Finished difference Result 860 states and 1057 transitions. [2025-03-04 10:30:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-04 10:30:45,947 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.2) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-04 10:30:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:45,949 INFO L225 Difference]: With dead ends: 860 [2025-03-04 10:30:45,949 INFO L226 Difference]: Without dead ends: 530 [2025-03-04 10:30:45,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1241, Invalid=4921, Unknown=0, NotChecked=0, Total=6162 [2025-03-04 10:30:45,951 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 141 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:45,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 33 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:30:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-04 10:30:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 410. [2025-03-04 10:30:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 408 states have (on average 1.1740196078431373) internal successors, (479), 409 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 479 transitions. [2025-03-04 10:30:45,988 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 479 transitions. Word has length 44 [2025-03-04 10:30:45,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:45,988 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 479 transitions. [2025-03-04 10:30:45,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.2) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 479 transitions. [2025-03-04 10:30:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 10:30:45,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:45,992 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 10:30:45,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:30:46,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:46,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:46,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1820851713, now seen corresponding path program 5 times [2025-03-04 10:30:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390844489] [2025-03-04 10:30:46,194 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:30:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:46,198 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 10 equivalence classes. [2025-03-04 10:30:46,200 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 17 of 50 statements. [2025-03-04 10:30:46,200 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:30:46,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:46,244 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 131 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 10:30:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:46,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390844489] [2025-03-04 10:30:46,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390844489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:46,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037701958] [2025-03-04 10:30:46,245 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:30:46,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:46,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:46,247 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:30:46,248 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:30:46,266 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 10 equivalence classes. [2025-03-04 10:30:46,274 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 17 of 50 statements. [2025-03-04 10:30:46,274 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:30:46,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:46,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:30:46,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 134 proven. 13 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 10:30:46,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 131 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 10:30:46,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037701958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:46,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:46,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 10:30:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470351337] [2025-03-04 10:30:46,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:46,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:30:46,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:46,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:30:46,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:30:46,360 INFO L87 Difference]: Start difference. First operand 410 states and 479 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:46,501 INFO L93 Difference]: Finished difference Result 747 states and 876 transitions. [2025-03-04 10:30:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:30:46,501 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-04 10:30:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:46,503 INFO L225 Difference]: With dead ends: 747 [2025-03-04 10:30:46,503 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 10:30:46,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:30:46,504 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:46,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 23 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:30:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 10:30:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2025-03-04 10:30:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 398 states have (on average 1.1130653266331658) internal successors, (443), 399 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 443 transitions. [2025-03-04 10:30:46,533 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 443 transitions. Word has length 50 [2025-03-04 10:30:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:46,534 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 443 transitions. [2025-03-04 10:30:46,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 443 transitions. [2025-03-04 10:30:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 10:30:46,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:46,536 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 10:30:46,542 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:30:46,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:46,737 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:46,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:46,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1607003675, now seen corresponding path program 6 times [2025-03-04 10:30:46,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:46,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356782326] [2025-03-04 10:30:46,737 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:30:46,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:46,741 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 9 equivalence classes. [2025-03-04 10:30:46,752 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 43 of 50 statements. [2025-03-04 10:30:46,753 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-04 10:30:46,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:30:46,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:46,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356782326] [2025-03-04 10:30:46,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356782326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:46,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057414674] [2025-03-04 10:30:46,868 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:30:46,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:46,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:46,870 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:30:46,872 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:30:46,888 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 9 equivalence classes. [2025-03-04 10:30:46,897 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 43 of 50 statements. [2025-03-04 10:30:46,897 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-04 10:30:46,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:46,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:30:46,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 40 proven. 146 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:30:47,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 4 proven. 182 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:30:47,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057414674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:47,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:47,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-04 10:30:47,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622017306] [2025-03-04 10:30:47,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:47,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:30:47,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:47,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:30:47,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:30:47,191 INFO L87 Difference]: Start difference. First operand 400 states and 443 transitions. Second operand has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:48,210 INFO L93 Difference]: Finished difference Result 860 states and 1091 transitions. [2025-03-04 10:30:48,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-03-04 10:30:48,210 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-04 10:30:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:48,213 INFO L225 Difference]: With dead ends: 860 [2025-03-04 10:30:48,213 INFO L226 Difference]: Without dead ends: 858 [2025-03-04 10:30:48,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2688 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1746, Invalid=6264, Unknown=0, NotChecked=0, Total=8010 [2025-03-04 10:30:48,215 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:48,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 50 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:30:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-03-04 10:30:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 739. [2025-03-04 10:30:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 737 states have (on average 1.1668928086838535) internal successors, (860), 738 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 860 transitions. [2025-03-04 10:30:48,256 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 860 transitions. Word has length 50 [2025-03-04 10:30:48,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:48,256 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 860 transitions. [2025-03-04 10:30:48,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 860 transitions. [2025-03-04 10:30:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 10:30:48,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:48,258 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 7, 6, 6, 6, 1, 1, 1, 1] [2025-03-04 10:30:48,263 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:30:48,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:48,462 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:48,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1325914221, now seen corresponding path program 7 times [2025-03-04 10:30:48,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:48,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166054501] [2025-03-04 10:30:48,462 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:30:48,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:48,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:30:48,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:30:48,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:48,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 78 proven. 326 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:30:48,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:48,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166054501] [2025-03-04 10:30:48,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166054501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:48,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508522678] [2025-03-04 10:30:48,676 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:30:48,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:48,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:48,679 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:30:48,681 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:30:48,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:30:48,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:30:48,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:30:48,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:48,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:30:48,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 103 proven. 301 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:30:48,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 78 proven. 326 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:30:49,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508522678] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:49,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:49,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 36 [2025-03-04 10:30:49,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463474095] [2025-03-04 10:30:49,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:49,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:30:49,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:49,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:30:49,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:30:49,166 INFO L87 Difference]: Start difference. First operand 739 states and 860 transitions. Second operand has 36 states, 36 states have (on average 3.8055555555555554) internal successors, (137), 36 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:50,210 INFO L93 Difference]: Finished difference Result 1295 states and 1534 transitions. [2025-03-04 10:30:50,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 10:30:50,211 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.8055555555555554) internal successors, (137), 36 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-04 10:30:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:50,213 INFO L225 Difference]: With dead ends: 1295 [2025-03-04 10:30:50,213 INFO L226 Difference]: Without dead ends: 853 [2025-03-04 10:30:50,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 115 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1436, Invalid=5704, Unknown=0, NotChecked=0, Total=7140 [2025-03-04 10:30:50,215 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 77 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:50,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 22 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:30:50,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-04 10:30:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 841. [2025-03-04 10:30:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 1.1513706793802145) internal successors, (966), 840 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 966 transitions. [2025-03-04 10:30:50,261 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 966 transitions. Word has length 70 [2025-03-04 10:30:50,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:50,261 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 966 transitions. [2025-03-04 10:30:50,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.8055555555555554) internal successors, (137), 36 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 966 transitions. [2025-03-04 10:30:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 10:30:50,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:50,262 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-03-04 10:30:50,272 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:30:50,463 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,SelfDestructingSolverStorable10 [2025-03-04 10:30:50,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:50,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1411470657, now seen corresponding path program 8 times [2025-03-04 10:30:50,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:50,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697640254] [2025-03-04 10:30:50,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:30:50,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:50,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-03-04 10:30:50,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:30:50,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:30:50,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:30:50,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:50,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697640254] [2025-03-04 10:30:50,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697640254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:50,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314452710] [2025-03-04 10:30:50,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:30:50,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:50,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:50,669 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:30:50,670 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:30:50,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-03-04 10:30:50,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:30:50,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:30:50,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:50,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:30:50,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:30:50,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:30:51,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314452710] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:51,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:51,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 32 [2025-03-04 10:30:51,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202960384] [2025-03-04 10:30:51,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:51,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 10:30:51,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:51,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 10:30:51,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=726, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 10:30:51,044 INFO L87 Difference]: Start difference. First operand 841 states and 966 transitions. Second operand has 33 states, 32 states have (on average 5.15625) internal successors, (165), 33 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:52,561 INFO L93 Difference]: Finished difference Result 2887 states and 3513 transitions. [2025-03-04 10:30:52,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2025-03-04 10:30:52,562 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 5.15625) internal successors, (165), 33 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-04 10:30:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:52,569 INFO L225 Difference]: With dead ends: 2887 [2025-03-04 10:30:52,569 INFO L226 Difference]: Without dead ends: 2885 [2025-03-04 10:30:52,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5686 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4096, Invalid=11654, Unknown=0, NotChecked=0, Total=15750 [2025-03-04 10:30:52,572 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 82 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:52,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:30:52,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2025-03-04 10:30:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2740. [2025-03-04 10:30:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2740 states, 2738 states have (on average 1.1614317019722424) internal successors, (3180), 2739 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3180 transitions. [2025-03-04 10:30:52,739 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3180 transitions. Word has length 80 [2025-03-04 10:30:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:52,739 INFO L471 AbstractCegarLoop]: Abstraction has 2740 states and 3180 transitions. [2025-03-04 10:30:52,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 5.15625) internal successors, (165), 33 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3180 transitions. [2025-03-04 10:30:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 10:30:52,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:52,742 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 16, 12, 11, 11, 11, 1, 1, 1, 1] [2025-03-04 10:30:52,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:30:52,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:52,946 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:52,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:52,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1679821373, now seen corresponding path program 9 times [2025-03-04 10:30:52,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:52,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276764021] [2025-03-04 10:30:52,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:30:52,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:52,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 99 statements into 19 equivalence classes. [2025-03-04 10:30:52,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 67 of 99 statements. [2025-03-04 10:30:52,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-04 10:30:52,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 424 proven. 184 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-04 10:30:53,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:53,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276764021] [2025-03-04 10:30:53,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276764021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:53,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610714563] [2025-03-04 10:30:53,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:30:53,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:53,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:53,127 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:30:53,128 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:30:53,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 99 statements into 19 equivalence classes. [2025-03-04 10:30:53,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 67 of 99 statements. [2025-03-04 10:30:53,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-04 10:30:53,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:53,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:30:53,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 424 proven. 184 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-04 10:30:53,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 424 proven. 184 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-04 10:30:53,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610714563] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:53,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:53,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-03-04 10:30:53,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249848776] [2025-03-04 10:30:53,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:53,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 10:30:53,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:53,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 10:30:53,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:30:53,521 INFO L87 Difference]: Start difference. First operand 2740 states and 3180 transitions. Second operand has 27 states, 26 states have (on average 3.576923076923077) internal successors, (93), 27 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:54,694 INFO L93 Difference]: Finished difference Result 3499 states and 4080 transitions. [2025-03-04 10:30:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 10:30:54,694 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.576923076923077) internal successors, (93), 27 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-04 10:30:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:54,704 INFO L225 Difference]: With dead ends: 3499 [2025-03-04 10:30:54,704 INFO L226 Difference]: Without dead ends: 3498 [2025-03-04 10:30:54,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1112, Invalid=4438, Unknown=0, NotChecked=0, Total=5550 [2025-03-04 10:30:54,708 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 83 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:54,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 21 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:30:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2025-03-04 10:30:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 2874. [2025-03-04 10:30:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2872 states have (on average 1.1337047353760445) internal successors, (3256), 2873 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 3256 transitions. [2025-03-04 10:30:54,885 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 3256 transitions. Word has length 99 [2025-03-04 10:30:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:30:54,885 INFO L471 AbstractCegarLoop]: Abstraction has 2874 states and 3256 transitions. [2025-03-04 10:30:54,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.576923076923077) internal successors, (93), 27 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:54,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 3256 transitions. [2025-03-04 10:30:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 10:30:54,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:30:54,887 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 25, 13, 12, 12, 12, 1, 1, 1, 1] [2025-03-04 10:30:54,893 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:30:55,088 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,SelfDestructingSolverStorable12 [2025-03-04 10:30:55,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:30:55,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:30:55,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1501839361, now seen corresponding path program 10 times [2025-03-04 10:30:55,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:30:55,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909209109] [2025-03-04 10:30:55,089 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:30:55,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:30:55,093 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 130 statements into 2 equivalence classes. [2025-03-04 10:30:55,105 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 10:30:55,105 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:30:55,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 734 proven. 142 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-04 10:30:55,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:30:55,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909209109] [2025-03-04 10:30:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909209109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:30:55,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479535341] [2025-03-04 10:30:55,312 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:30:55,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:30:55,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:30:55,315 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:30:55,316 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:30:55,337 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 130 statements into 2 equivalence classes. [2025-03-04 10:30:55,358 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 10:30:55,359 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:30:55,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:30:55,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:30:55,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:30:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 854 proven. 251 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-03-04 10:30:55,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:30:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 851 proven. 254 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-03-04 10:30:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479535341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:30:55,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:30:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 37 [2025-03-04 10:30:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335347707] [2025-03-04 10:30:55,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:30:55,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 10:30:55,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:30:55,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 10:30:55,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 10:30:55,918 INFO L87 Difference]: Start difference. First operand 2874 states and 3256 transitions. Second operand has 37 states, 37 states have (on average 3.810810810810811) internal successors, (141), 37 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:30:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:30:59,455 INFO L93 Difference]: Finished difference Result 8241 states and 9626 transitions. [2025-03-04 10:30:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2025-03-04 10:30:59,455 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.810810810810811) internal successors, (141), 37 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-03-04 10:30:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:30:59,471 INFO L225 Difference]: With dead ends: 8241 [2025-03-04 10:30:59,471 INFO L226 Difference]: Without dead ends: 6709 [2025-03-04 10:30:59,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 235 SyntacticMatches, 4 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7574 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3174, Invalid=19778, Unknown=0, NotChecked=0, Total=22952 [2025-03-04 10:30:59,477 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 398 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:30:59,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 32 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:30:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2025-03-04 10:30:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 5936. [2025-03-04 10:30:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5936 states, 5934 states have (on average 1.1248736097067744) internal successors, (6675), 5935 states have internal predecessors, (6675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5936 states to 5936 states and 6675 transitions. [2025-03-04 10:31:00,007 INFO L78 Accepts]: Start accepts. Automaton has 5936 states and 6675 transitions. Word has length 130 [2025-03-04 10:31:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:31:00,007 INFO L471 AbstractCegarLoop]: Abstraction has 5936 states and 6675 transitions. [2025-03-04 10:31:00,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.810810810810811) internal successors, (141), 37 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5936 states and 6675 transitions. [2025-03-04 10:31:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 10:31:00,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:31:00,012 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 28, 14, 13, 13, 13, 1, 1, 1, 1] [2025-03-04 10:31:00,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:31:00,216 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,SelfDestructingSolverStorable13 [2025-03-04 10:31:00,216 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:31:00,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:31:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash -392820265, now seen corresponding path program 11 times [2025-03-04 10:31:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:31:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101795539] [2025-03-04 10:31:00,217 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:31:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:31:00,223 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 143 statements into 24 equivalence classes. [2025-03-04 10:31:00,242 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 10:31:00,242 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-04 10:31:00,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:31:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1920 backedges. 472 proven. 1356 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 10:31:00,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:31:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101795539] [2025-03-04 10:31:00,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101795539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:31:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465503520] [2025-03-04 10:31:00,593 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:31:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:31:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:31:00,595 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:31:00,596 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:31:00,618 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 143 statements into 24 equivalence classes. [2025-03-04 10:31:00,646 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 10:31:00,646 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-04 10:31:00,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:31:00,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:31:00,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:31:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1920 backedges. 1141 proven. 553 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-04 10:31:01,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:31:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1920 backedges. 1132 proven. 562 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-04 10:31:01,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465503520] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:31:01,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:31:01,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 52 [2025-03-04 10:31:01,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31917375] [2025-03-04 10:31:01,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:31:01,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-04 10:31:01,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:31:01,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-04 10:31:01,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2336, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 10:31:01,493 INFO L87 Difference]: Start difference. First operand 5936 states and 6675 transitions. Second operand has 52 states, 52 states have (on average 4.884615384615385) internal successors, (254), 52 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:31:13,096 INFO L93 Difference]: Finished difference Result 9039 states and 10415 transitions. [2025-03-04 10:31:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 396 states. [2025-03-04 10:31:13,097 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.884615384615385) internal successors, (254), 52 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-03-04 10:31:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:31:13,113 INFO L225 Difference]: With dead ends: 9039 [2025-03-04 10:31:13,113 INFO L226 Difference]: Without dead ends: 6661 [2025-03-04 10:31:13,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 251 SyntacticMatches, 3 SemanticMatches, 425 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77152 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=19340, Invalid=162562, Unknown=0, NotChecked=0, Total=181902 [2025-03-04 10:31:13,127 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 897 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:31:13,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 32 Invalid, 2958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 10:31:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2025-03-04 10:31:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 5802. [2025-03-04 10:31:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5802 states, 5800 states have (on average 1.1237931034482758) internal successors, (6518), 5801 states have internal predecessors, (6518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5802 states to 5802 states and 6518 transitions. [2025-03-04 10:31:13,681 INFO L78 Accepts]: Start accepts. Automaton has 5802 states and 6518 transitions. Word has length 143 [2025-03-04 10:31:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:31:13,682 INFO L471 AbstractCegarLoop]: Abstraction has 5802 states and 6518 transitions. [2025-03-04 10:31:13,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.884615384615385) internal successors, (254), 52 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 5802 states and 6518 transitions. [2025-03-04 10:31:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 10:31:13,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:31:13,685 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 27, 17, 16, 16, 16, 1, 1, 1, 1] [2025-03-04 10:31:13,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:31:13,886 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,SelfDestructingSolverStorable14 [2025-03-04 10:31:13,887 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:31:13,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:31:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1277286561, now seen corresponding path program 12 times [2025-03-04 10:31:13,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:31:13,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496003546] [2025-03-04 10:31:13,888 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:31:13,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:31:13,892 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 152 statements into 29 equivalence classes. [2025-03-04 10:31:13,904 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) and asserted 145 of 152 statements. [2025-03-04 10:31:13,904 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2025-03-04 10:31:13,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:31:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2078 backedges. 838 proven. 1048 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-04 10:31:14,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:31:14,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496003546] [2025-03-04 10:31:14,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496003546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:31:14,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072037478] [2025-03-04 10:31:14,152 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:31:14,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:31:14,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:31:14,154 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:31:14,156 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:31:14,179 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 152 statements into 29 equivalence classes. [2025-03-04 10:31:14,209 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) and asserted 145 of 152 statements. [2025-03-04 10:31:14,210 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2025-03-04 10:31:14,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:31:14,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:31:14,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:31:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2078 backedges. 636 proven. 1333 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-04 10:31:14,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:31:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2078 backedges. 636 proven. 1333 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-04 10:31:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072037478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:31:15,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:31:15,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 43 [2025-03-04 10:31:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688835368] [2025-03-04 10:31:15,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:31:15,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 10:31:15,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:31:15,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 10:31:15,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=1417, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 10:31:15,050 INFO L87 Difference]: Start difference. First operand 5802 states and 6518 transitions. Second operand has 44 states, 43 states have (on average 4.837209302325581) internal successors, (208), 44 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:31:19,834 INFO L93 Difference]: Finished difference Result 9865 states and 11488 transitions. [2025-03-04 10:31:19,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2025-03-04 10:31:19,835 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 4.837209302325581) internal successors, (208), 44 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-03-04 10:31:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:31:19,854 INFO L225 Difference]: With dead ends: 9865 [2025-03-04 10:31:19,855 INFO L226 Difference]: Without dead ends: 9864 [2025-03-04 10:31:19,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13574 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7658, Invalid=30562, Unknown=0, NotChecked=0, Total=38220 [2025-03-04 10:31:19,858 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 195 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:31:19,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 16 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:31:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9864 states. [2025-03-04 10:31:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9864 to 7437. [2025-03-04 10:31:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7437 states, 7435 states have (on average 1.1175521183591124) internal successors, (8309), 7436 states have internal predecessors, (8309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7437 states to 7437 states and 8309 transitions. [2025-03-04 10:31:20,579 INFO L78 Accepts]: Start accepts. Automaton has 7437 states and 8309 transitions. Word has length 152 [2025-03-04 10:31:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:31:20,579 INFO L471 AbstractCegarLoop]: Abstraction has 7437 states and 8309 transitions. [2025-03-04 10:31:20,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 4.837209302325581) internal successors, (208), 44 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7437 states and 8309 transitions. [2025-03-04 10:31:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 10:31:20,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:31:20,583 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 23, 23, 22, 22, 22, 1, 1, 1, 1] [2025-03-04 10:31:20,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:31:20,784 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,SelfDestructingSolverStorable15 [2025-03-04 10:31:20,784 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:31:20,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:31:20,784 INFO L85 PathProgramCache]: Analyzing trace with hash -756154689, now seen corresponding path program 13 times [2025-03-04 10:31:20,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:31:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895732510] [2025-03-04 10:31:20,785 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:31:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:31:20,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 10:31:20,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 10:31:20,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:31:20,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:31:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2302 backedges. 0 proven. 2280 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:31:21,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:31:21,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895732510] [2025-03-04 10:31:21,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895732510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:31:21,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891617633] [2025-03-04 10:31:21,150 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:31:21,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:31:21,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:31:21,151 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:31:21,152 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:31:21,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 10:31:21,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 10:31:21,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:31:21,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:31:21,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:31:21,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:31:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2302 backedges. 0 proven. 2280 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:31:21,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:31:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2302 backedges. 0 proven. 2280 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:31:21,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891617633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:31:21,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:31:21,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 56 [2025-03-04 10:31:21,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299450568] [2025-03-04 10:31:21,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:31:21,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-04 10:31:21,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:31:21,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-04 10:31:21,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1206, Invalid=1986, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 10:31:21,991 INFO L87 Difference]: Start difference. First operand 7437 states and 8309 transitions. Second operand has 57 states, 56 states have (on average 5.946428571428571) internal successors, (333), 57 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:31:28,694 INFO L93 Difference]: Finished difference Result 32677 states and 39766 transitions. [2025-03-04 10:31:28,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 251 states. [2025-03-04 10:31:28,694 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 5.946428571428571) internal successors, (333), 57 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-03-04 10:31:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:31:28,750 INFO L225 Difference]: With dead ends: 32677 [2025-03-04 10:31:28,750 INFO L226 Difference]: Without dead ends: 32675 [2025-03-04 10:31:28,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25792 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=17392, Invalid=48914, Unknown=0, NotChecked=0, Total=66306 [2025-03-04 10:31:28,759 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 172 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:31:28,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 56 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:31:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32675 states. [2025-03-04 10:31:31,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32675 to 31786. [2025-03-04 10:31:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31786 states, 31784 states have (on average 1.126132645356154) internal successors, (35793), 31785 states have internal predecessors, (35793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31786 states to 31786 states and 35793 transitions. [2025-03-04 10:31:31,830 INFO L78 Accepts]: Start accepts. Automaton has 31786 states and 35793 transitions. Word has length 164 [2025-03-04 10:31:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:31:31,831 INFO L471 AbstractCegarLoop]: Abstraction has 31786 states and 35793 transitions. [2025-03-04 10:31:31,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 5.946428571428571) internal successors, (333), 57 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:31,832 INFO L276 IsEmpty]: Start isEmpty. Operand 31786 states and 35793 transitions. [2025-03-04 10:31:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-04 10:31:31,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:31:31,853 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 59, 33, 32, 32, 32, 1, 1, 1, 1] [2025-03-04 10:31:31,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:31:32,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:31:32,054 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:31:32,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:31:32,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1188213873, now seen corresponding path program 14 times [2025-03-04 10:31:32,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:31:32,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844885236] [2025-03-04 10:31:32,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:31:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:31:32,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 312 statements into 2 equivalence classes. [2025-03-04 10:31:32,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 10:31:32,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:31:32,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:31:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9246 backedges. 0 proven. 3359 refuted. 0 times theorem prover too weak. 5887 trivial. 0 not checked. [2025-03-04 10:31:32,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:31:32,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844885236] [2025-03-04 10:31:32,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844885236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:31:32,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044256618] [2025-03-04 10:31:32,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:31:32,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:31:32,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:31:32,350 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:31:32,352 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:31:32,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 312 statements into 2 equivalence classes. [2025-03-04 10:31:32,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 10:31:32,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:31:32,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:31:32,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:31:32,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:31:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9246 backedges. 4918 proven. 1069 refuted. 0 times theorem prover too weak. 3259 trivial. 0 not checked. [2025-03-04 10:31:32,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:31:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9246 backedges. 4907 proven. 1080 refuted. 0 times theorem prover too weak. 3259 trivial. 0 not checked. [2025-03-04 10:31:33,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044256618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:31:33,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:31:33,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 23] total 42 [2025-03-04 10:31:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234109660] [2025-03-04 10:31:33,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:31:33,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 10:31:33,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:31:33,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 10:31:33,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 10:31:33,081 INFO L87 Difference]: Start difference. First operand 31786 states and 35793 transitions. Second operand has 42 states, 42 states have (on average 4.809523809523809) internal successors, (202), 42 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:31:41,161 INFO L93 Difference]: Finished difference Result 33662 states and 38003 transitions. [2025-03-04 10:31:41,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2025-03-04 10:31:41,161 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.809523809523809) internal successors, (202), 42 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312 [2025-03-04 10:31:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:31:41,214 INFO L225 Difference]: With dead ends: 33662 [2025-03-04 10:31:41,214 INFO L226 Difference]: Without dead ends: 31695 [2025-03-04 10:31:41,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 589 SyntacticMatches, 8 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32517 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=11381, Invalid=70129, Unknown=0, NotChecked=0, Total=81510 [2025-03-04 10:31:41,228 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 172 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:31:41,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 34 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:31:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31695 states. [2025-03-04 10:31:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31695 to 31215. [2025-03-04 10:31:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31215 states, 31213 states have (on average 1.1251401659564926) internal successors, (35119), 31214 states have internal predecessors, (35119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31215 states to 31215 states and 35119 transitions. [2025-03-04 10:31:43,944 INFO L78 Accepts]: Start accepts. Automaton has 31215 states and 35119 transitions. Word has length 312 [2025-03-04 10:31:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:31:43,944 INFO L471 AbstractCegarLoop]: Abstraction has 31215 states and 35119 transitions. [2025-03-04 10:31:43,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.809523809523809) internal successors, (202), 42 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:31:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 31215 states and 35119 transitions. [2025-03-04 10:31:43,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-04 10:31:43,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:31:43,965 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 60, 34, 33, 33, 33, 1, 1, 1, 1] [2025-03-04 10:31:43,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:31:44,166 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,SelfDestructingSolverStorable17 [2025-03-04 10:31:44,166 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:31:44,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:31:44,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1618877569, now seen corresponding path program 15 times [2025-03-04 10:31:44,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:31:44,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092318403] [2025-03-04 10:31:44,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:31:44,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:31:44,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 319 statements into 60 equivalence classes. [2025-03-04 10:31:44,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) and asserted 310 of 319 statements. [2025-03-04 10:31:44,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2025-03-04 10:31:44,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:31:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9648 backedges. 0 proven. 9515 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-04 10:31:45,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:31:45,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092318403] [2025-03-04 10:31:45,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092318403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:31:45,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242449496] [2025-03-04 10:31:45,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:31:45,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:31:45,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:31:45,073 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:31:45,074 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:31:45,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 319 statements into 60 equivalence classes. [2025-03-04 10:31:45,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) and asserted 310 of 319 statements. [2025-03-04 10:31:45,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2025-03-04 10:31:45,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:31:45,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 10:31:45,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:31:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9648 backedges. 0 proven. 9515 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-04 10:31:45,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:31:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9648 backedges. 0 proven. 9515 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-04 10:31:46,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242449496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:31:46,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:31:46,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 81 [2025-03-04 10:31:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655869806] [2025-03-04 10:31:46,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:31:46,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2025-03-04 10:31:46,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:31:46,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2025-03-04 10:31:46,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2561, Invalid=4081, Unknown=0, NotChecked=0, Total=6642 [2025-03-04 10:31:46,731 INFO L87 Difference]: Start difference. First operand 31215 states and 35119 transitions. Second operand has 82 states, 81 states have (on average 6.1234567901234565) internal successors, (496), 82 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:12,163 INFO L93 Difference]: Finished difference Result 61021 states and 72056 transitions. [2025-03-04 10:32:12,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 592 states. [2025-03-04 10:32:12,167 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 6.1234567901234565) internal successors, (496), 82 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 319 [2025-03-04 10:32:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:12,273 INFO L225 Difference]: With dead ends: 61021 [2025-03-04 10:32:12,273 INFO L226 Difference]: Without dead ends: 61019 [2025-03-04 10:32:12,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1197 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 602 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177719 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=94369, Invalid=269843, Unknown=0, NotChecked=0, Total=364212 [2025-03-04 10:32:12,298 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 225 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:12,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 25 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:32:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61019 states.