./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label45.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9cd15529a9b2dd098d5ccb70769668148a833250f0918a0771464210899319de --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:42:55,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:42:55,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:42:55,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:42:55,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:42:55,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:42:55,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:42:55,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:42:55,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:42:55,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:42:55,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:42:55,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:42:55,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:42:55,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:42:55,176 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:42:55,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:42:55,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:42:55,176 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:42:55,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:42:55,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:42:55,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:42:55,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:42:55,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:42:55,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:42:55,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:42:55,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:42:55,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:42:55,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:42:55,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:42:55,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:42:55,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:42:55,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:42:55,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:55,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:42:55,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:42:55,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:42:55,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:42:55,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:55,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:42:55,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:42:55,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:42:55,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:42:55,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:42:55,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:42:55,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:42:55,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:42:55,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:42:55,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:42:55,179 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-jdk21/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9cd15529a9b2dd098d5ccb70769668148a833250f0918a0771464210899319de [2025-01-08 23:42:55,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:42:55,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:42:55,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:42:55,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:42:55,351 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:42:55,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label45.c [2025-01-08 23:42:56,403 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/788e2043d/371601220118402d998702b144fadae9/FLAGd0c2174f1 [2025-01-08 23:42:56,750 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:42:56,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label45.c [2025-01-08 23:42:56,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/788e2043d/371601220118402d998702b144fadae9/FLAGd0c2174f1 [2025-01-08 23:42:56,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/788e2043d/371601220118402d998702b144fadae9 [2025-01-08 23:42:56,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:42:56,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:42:56,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:42:56,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:42:56,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:42:56,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:42:56" (1/1) ... [2025-01-08 23:42:56,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152a8622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:56, skipping insertion in model container [2025-01-08 23:42:56,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:42:56" (1/1) ... [2025-01-08 23:42:56,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:42:56,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label45.c[4714,4727] [2025-01-08 23:42:57,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:42:57,153 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:42:57,178 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label45.c[4714,4727] [2025-01-08 23:42:57,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:42:57,307 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:42:57,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57 WrapperNode [2025-01-08 23:42:57,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:42:57,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:42:57,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:42:57,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:42:57,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,421 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:42:57,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:42:57,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:42:57,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:42:57,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:42:57,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,523 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:42:57,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,557 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:42:57,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:42:57,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:42:57,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:42:57,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (1/1) ... [2025-01-08 23:42:57,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:57,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:57,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:42:57,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:42:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:42:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:42:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:42:57,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:42:57,698 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:42:57,700 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:42:58,839 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:42:58,840 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:42:58,856 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:42:58,859 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:42:58,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:58 BoogieIcfgContainer [2025-01-08 23:42:58,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:42:58,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:42:58,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:42:58,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:42:58,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:42:56" (1/3) ... [2025-01-08 23:42:58,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7958015d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:42:58, skipping insertion in model container [2025-01-08 23:42:58,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:57" (2/3) ... [2025-01-08 23:42:58,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7958015d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:42:58, skipping insertion in model container [2025-01-08 23:42:58,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:58" (3/3) ... [2025-01-08 23:42:58,866 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label45.c [2025-01-08 23:42:58,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:42:58,876 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label45.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:42:58,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:42:58,928 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;@17af7839, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:42:58,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:42:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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-01-08 23:42:58,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 23:42:58,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:58,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:58,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:58,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash 771715890, now seen corresponding path program 1 times [2025-01-08 23:42:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:58,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057847409] [2025-01-08 23:42:58,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:58,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 23:42:59,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 23:42:59,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:59,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:59,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057847409] [2025-01-08 23:42:59,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057847409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:59,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:59,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607987205] [2025-01-08 23:42:59,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:59,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:59,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:59,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:59,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:59,140 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:59,954 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-01-08 23:42:59,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:59,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-08 23:42:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:59,962 INFO L225 Difference]: With dead ends: 761 [2025-01-08 23:42:59,962 INFO L226 Difference]: Without dead ends: 413 [2025-01-08 23:42:59,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:59,966 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 196 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:59,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-08 23:42:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-01-08 23:42:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 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-01-08 23:43:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-01-08 23:43:00,003 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 32 [2025-01-08 23:43:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:00,003 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-01-08 23:43:00,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-01-08 23:43:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-08 23:43:00,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:00,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:00,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:43:00,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:00,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:00,007 INFO L85 PathProgramCache]: Analyzing trace with hash -211974358, now seen corresponding path program 1 times [2025-01-08 23:43:00,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:00,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809824270] [2025-01-08 23:43:00,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:00,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:00,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-08 23:43:00,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-08 23:43:00,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:00,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:00,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:00,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809824270] [2025-01-08 23:43:00,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809824270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:00,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:00,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248821430] [2025-01-08 23:43:00,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:00,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:00,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:00,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:00,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:00,202 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 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-01-08 23:43:00,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:00,814 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-01-08 23:43:00,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:00,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 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 100 [2025-01-08 23:43:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:00,817 INFO L225 Difference]: With dead ends: 1211 [2025-01-08 23:43:00,817 INFO L226 Difference]: Without dead ends: 800 [2025-01-08 23:43:00,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:00,819 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:00,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-08 23:43:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-01-08 23:43:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 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-01-08 23:43:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2025-01-08 23:43:00,839 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 100 [2025-01-08 23:43:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:00,839 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2025-01-08 23:43:00,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 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-01-08 23:43:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2025-01-08 23:43:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-08 23:43:00,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:00,840 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:00,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:43:00,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:00,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:00,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1133742823, now seen corresponding path program 1 times [2025-01-08 23:43:00,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:00,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970057351] [2025-01-08 23:43:00,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:00,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-08 23:43:00,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-08 23:43:00,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:00,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:01,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:01,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970057351] [2025-01-08 23:43:01,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970057351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:01,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:01,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:01,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600567529] [2025-01-08 23:43:01,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:01,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:01,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:01,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:01,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:01,034 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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-01-08 23:43:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:01,646 INFO L93 Difference]: Finished difference Result 2314 states and 3184 transitions. [2025-01-08 23:43:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:01,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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 101 [2025-01-08 23:43:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:01,651 INFO L225 Difference]: With dead ends: 2314 [2025-01-08 23:43:01,651 INFO L226 Difference]: Without dead ends: 1527 [2025-01-08 23:43:01,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:01,652 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 120 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:01,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-01-08 23:43:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2025-01-08 23:43:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2177049180327868) internal successors, (1857), 1525 states have internal predecessors, (1857), 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-01-08 23:43:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1857 transitions. [2025-01-08 23:43:01,677 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1857 transitions. Word has length 101 [2025-01-08 23:43:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:01,677 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1857 transitions. [2025-01-08 23:43:01,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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-01-08 23:43:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1857 transitions. [2025-01-08 23:43:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-08 23:43:01,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:01,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:01,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:43:01,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:01,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash -405950174, now seen corresponding path program 1 times [2025-01-08 23:43:01,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:01,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910467253] [2025-01-08 23:43:01,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:01,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:01,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-08 23:43:01,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-08 23:43:01,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:01,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:01,853 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:01,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:01,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910467253] [2025-01-08 23:43:01,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910467253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:01,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:01,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:01,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248847817] [2025-01-08 23:43:01,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:01,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:01,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:01,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:01,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:01,854 INFO L87 Difference]: Start difference. First operand 1526 states and 1857 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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-01-08 23:43:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:03,167 INFO L93 Difference]: Finished difference Result 4184 states and 5343 transitions. [2025-01-08 23:43:03,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:03,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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 159 [2025-01-08 23:43:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:03,189 INFO L225 Difference]: With dead ends: 4184 [2025-01-08 23:43:03,189 INFO L226 Difference]: Without dead ends: 2844 [2025-01-08 23:43:03,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:03,197 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 363 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:03,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 84 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-08 23:43:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2025-01-08 23:43:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2843. [2025-01-08 23:43:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 2842 states have (on average 1.256509500351865) internal successors, (3571), 2842 states have internal predecessors, (3571), 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-01-08 23:43:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 3571 transitions. [2025-01-08 23:43:03,290 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 3571 transitions. Word has length 159 [2025-01-08 23:43:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:03,290 INFO L471 AbstractCegarLoop]: Abstraction has 2843 states and 3571 transitions. [2025-01-08 23:43:03,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 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-01-08 23:43:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 3571 transitions. [2025-01-08 23:43:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-08 23:43:03,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:03,294 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:03,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:43:03,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:03,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1706912218, now seen corresponding path program 1 times [2025-01-08 23:43:03,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:03,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697422392] [2025-01-08 23:43:03,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:03,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-08 23:43:03,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-08 23:43:03,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:03,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:03,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:03,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697422392] [2025-01-08 23:43:03,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697422392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:03,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:03,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:03,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128923107] [2025-01-08 23:43:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:03,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:03,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:03,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:03,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:03,700 INFO L87 Difference]: Start difference. First operand 2843 states and 3571 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-01-08 23:43:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:04,355 INFO L93 Difference]: Finished difference Result 6621 states and 8494 transitions. [2025-01-08 23:43:04,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:04,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 212 [2025-01-08 23:43:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:04,365 INFO L225 Difference]: With dead ends: 6621 [2025-01-08 23:43:04,366 INFO L226 Difference]: Without dead ends: 4148 [2025-01-08 23:43:04,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:04,369 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:04,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 346 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:04,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2025-01-08 23:43:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 3949. [2025-01-08 23:43:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3949 states, 3948 states have (on average 1.2332826747720365) internal successors, (4869), 3948 states have internal predecessors, (4869), 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-01-08 23:43:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 4869 transitions. [2025-01-08 23:43:04,418 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 4869 transitions. Word has length 212 [2025-01-08 23:43:04,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:04,419 INFO L471 AbstractCegarLoop]: Abstraction has 3949 states and 4869 transitions. [2025-01-08 23:43:04,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-01-08 23:43:04,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 4869 transitions. [2025-01-08 23:43:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-08 23:43:04,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:04,421 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:04,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:43:04,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:04,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2035309419, now seen corresponding path program 1 times [2025-01-08 23:43:04,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:04,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690413052] [2025-01-08 23:43:04,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:04,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:04,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-08 23:43:04,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-08 23:43:04,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:04,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-08 23:43:04,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:04,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690413052] [2025-01-08 23:43:04,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690413052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:04,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:04,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:04,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201284533] [2025-01-08 23:43:04,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:04,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:04,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:04,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:04,612 INFO L87 Difference]: Start difference. First operand 3949 states and 4869 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-01-08 23:43:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:05,301 INFO L93 Difference]: Finished difference Result 8650 states and 10747 transitions. [2025-01-08 23:43:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:05,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 213 [2025-01-08 23:43:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:05,316 INFO L225 Difference]: With dead ends: 8650 [2025-01-08 23:43:05,316 INFO L226 Difference]: Without dead ends: 4887 [2025-01-08 23:43:05,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:05,321 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 170 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:05,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 348 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:43:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states. [2025-01-08 23:43:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4869. [2025-01-08 23:43:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.2237058340180773) internal successors, (5957), 4868 states have internal predecessors, (5957), 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-01-08 23:43:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 5957 transitions. [2025-01-08 23:43:05,386 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 5957 transitions. Word has length 213 [2025-01-08 23:43:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:05,386 INFO L471 AbstractCegarLoop]: Abstraction has 4869 states and 5957 transitions. [2025-01-08 23:43:05,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-01-08 23:43:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 5957 transitions. [2025-01-08 23:43:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-08 23:43:05,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:05,388 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:05,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:43:05,388 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:05,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash 619478561, now seen corresponding path program 1 times [2025-01-08 23:43:05,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:05,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101502197] [2025-01-08 23:43:05,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:05,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:05,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-08 23:43:05,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-08 23:43:05,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:05,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:43:05,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:05,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101502197] [2025-01-08 23:43:05,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101502197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:05,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:05,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:05,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973784038] [2025-01-08 23:43:05,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:05,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:05,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:05,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:05,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:05,558 INFO L87 Difference]: Start difference. First operand 4869 states and 5957 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-01-08 23:43:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:06,293 INFO L93 Difference]: Finished difference Result 10482 states and 13052 transitions. [2025-01-08 23:43:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:06,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 214 [2025-01-08 23:43:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:06,306 INFO L225 Difference]: With dead ends: 10482 [2025-01-08 23:43:06,306 INFO L226 Difference]: Without dead ends: 5983 [2025-01-08 23:43:06,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:06,310 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 165 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:06,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 369 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:43:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2025-01-08 23:43:06,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 5789. [2025-01-08 23:43:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5789 states, 5788 states have (on average 1.218728403593642) internal successors, (7054), 5788 states have internal predecessors, (7054), 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-01-08 23:43:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7054 transitions. [2025-01-08 23:43:06,371 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7054 transitions. Word has length 214 [2025-01-08 23:43:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:06,372 INFO L471 AbstractCegarLoop]: Abstraction has 5789 states and 7054 transitions. [2025-01-08 23:43:06,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-01-08 23:43:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7054 transitions. [2025-01-08 23:43:06,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-08 23:43:06,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:06,374 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:06,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:43:06,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:06,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:06,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2049463825, now seen corresponding path program 1 times [2025-01-08 23:43:06,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:06,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446527359] [2025-01-08 23:43:06,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:06,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-08 23:43:06,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-08 23:43:06,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:06,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:06,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:06,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446527359] [2025-01-08 23:43:06,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446527359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:06,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:06,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:43:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012569751] [2025-01-08 23:43:06,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:06,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:06,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:06,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:06,656 INFO L87 Difference]: Start difference. First operand 5789 states and 7054 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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-01-08 23:43:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:07,905 INFO L93 Difference]: Finished difference Result 17138 states and 21434 transitions. [2025-01-08 23:43:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:07,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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 234 [2025-01-08 23:43:07,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:07,940 INFO L225 Difference]: With dead ends: 17138 [2025-01-08 23:43:07,940 INFO L226 Difference]: Without dead ends: 11719 [2025-01-08 23:43:07,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:07,947 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 302 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:07,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 232 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-08 23:43:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11719 states. [2025-01-08 23:43:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11719 to 11714. [2025-01-08 23:43:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11714 states, 11713 states have (on average 1.1990950226244343) internal successors, (14045), 11713 states have internal predecessors, (14045), 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-01-08 23:43:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11714 states to 11714 states and 14045 transitions. [2025-01-08 23:43:08,093 INFO L78 Accepts]: Start accepts. Automaton has 11714 states and 14045 transitions. Word has length 234 [2025-01-08 23:43:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:08,094 INFO L471 AbstractCegarLoop]: Abstraction has 11714 states and 14045 transitions. [2025-01-08 23:43:08,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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-01-08 23:43:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 11714 states and 14045 transitions. [2025-01-08 23:43:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-01-08 23:43:08,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:08,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:08,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:43:08,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:08,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1584637418, now seen corresponding path program 1 times [2025-01-08 23:43:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:08,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368824156] [2025-01-08 23:43:08,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:08,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-08 23:43:08,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-08 23:43:08,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:08,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:08,445 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:08,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368824156] [2025-01-08 23:43:08,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368824156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:08,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:08,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:43:08,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352180021] [2025-01-08 23:43:08,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:08,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:08,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:08,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:08,450 INFO L87 Difference]: Start difference. First operand 11714 states and 14045 transitions. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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-01-08 23:43:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:09,562 INFO L93 Difference]: Finished difference Result 28223 states and 34462 transitions. [2025-01-08 23:43:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:09,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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 244 [2025-01-08 23:43:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:09,587 INFO L225 Difference]: With dead ends: 28223 [2025-01-08 23:43:09,588 INFO L226 Difference]: Without dead ends: 16879 [2025-01-08 23:43:09,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:09,602 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 311 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:09,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 132 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:43:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16879 states. [2025-01-08 23:43:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16879 to 16867. [2025-01-08 23:43:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16867 states, 16866 states have (on average 1.204494248784537) internal successors, (20315), 16866 states have internal predecessors, (20315), 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-01-08 23:43:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16867 states to 16867 states and 20315 transitions. [2025-01-08 23:43:09,781 INFO L78 Accepts]: Start accepts. Automaton has 16867 states and 20315 transitions. Word has length 244 [2025-01-08 23:43:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:09,782 INFO L471 AbstractCegarLoop]: Abstraction has 16867 states and 20315 transitions. [2025-01-08 23:43:09,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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-01-08 23:43:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 16867 states and 20315 transitions. [2025-01-08 23:43:09,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-08 23:43:09,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:09,785 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:09,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:43:09,785 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:09,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1563529730, now seen corresponding path program 1 times [2025-01-08 23:43:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:09,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604469156] [2025-01-08 23:43:09,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:09,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:09,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-08 23:43:09,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-08 23:43:09,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:09,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-08 23:43:09,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604469156] [2025-01-08 23:43:09,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604469156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:09,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:09,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:09,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491837382] [2025-01-08 23:43:09,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:09,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:09,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:09,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:09,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:09,955 INFO L87 Difference]: Start difference. First operand 16867 states and 20315 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-01-08 23:43:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:10,736 INFO L93 Difference]: Finished difference Result 33558 states and 40459 transitions. [2025-01-08 23:43:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:10,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 251 [2025-01-08 23:43:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:10,761 INFO L225 Difference]: With dead ends: 33558 [2025-01-08 23:43:10,762 INFO L226 Difference]: Without dead ends: 16877 [2025-01-08 23:43:10,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:10,776 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 169 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:10,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 377 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:43:10,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16877 states. [2025-01-08 23:43:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16877 to 16866. [2025-01-08 23:43:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16866 states, 16865 states have (on average 1.1677438482063445) internal successors, (19694), 16865 states have internal predecessors, (19694), 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-01-08 23:43:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16866 states to 16866 states and 19694 transitions. [2025-01-08 23:43:10,979 INFO L78 Accepts]: Start accepts. Automaton has 16866 states and 19694 transitions. Word has length 251 [2025-01-08 23:43:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:10,979 INFO L471 AbstractCegarLoop]: Abstraction has 16866 states and 19694 transitions. [2025-01-08 23:43:10,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-01-08 23:43:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 16866 states and 19694 transitions. [2025-01-08 23:43:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-08 23:43:10,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:10,983 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:10,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:43:10,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:10,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1619544005, now seen corresponding path program 1 times [2025-01-08 23:43:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:10,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326932571] [2025-01-08 23:43:10,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:10,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:11,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-08 23:43:11,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-08 23:43:11,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:11,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:11,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326932571] [2025-01-08 23:43:11,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326932571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:11,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620032690] [2025-01-08 23:43:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:11,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:11,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:11,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:11,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:11,240 INFO L87 Difference]: Start difference. First operand 16866 states and 19694 transitions. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 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-01-08 23:43:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:12,292 INFO L93 Difference]: Finished difference Result 35938 states and 42309 transitions. [2025-01-08 23:43:12,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:12,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 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 265 [2025-01-08 23:43:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:12,322 INFO L225 Difference]: With dead ends: 35938 [2025-01-08 23:43:12,322 INFO L226 Difference]: Without dead ends: 18889 [2025-01-08 23:43:12,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:12,339 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 215 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:12,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 171 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:43:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18889 states. [2025-01-08 23:43:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18889 to 17584. [2025-01-08 23:43:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17584 states, 17583 states have (on average 1.1297844508900643) internal successors, (19865), 17583 states have internal predecessors, (19865), 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-01-08 23:43:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17584 states to 17584 states and 19865 transitions. [2025-01-08 23:43:12,508 INFO L78 Accepts]: Start accepts. Automaton has 17584 states and 19865 transitions. Word has length 265 [2025-01-08 23:43:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:12,508 INFO L471 AbstractCegarLoop]: Abstraction has 17584 states and 19865 transitions. [2025-01-08 23:43:12,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 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-01-08 23:43:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 17584 states and 19865 transitions. [2025-01-08 23:43:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-08 23:43:12,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:12,515 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:12,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:43:12,515 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:12,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash 11058224, now seen corresponding path program 1 times [2025-01-08 23:43:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:12,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573374627] [2025-01-08 23:43:12,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:12,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-08 23:43:12,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-08 23:43:12,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:12,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-01-08 23:43:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573374627] [2025-01-08 23:43:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573374627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:12,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:12,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:12,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937165494] [2025-01-08 23:43:12,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:12,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:12,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:12,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:12,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:12,752 INFO L87 Difference]: Start difference. First operand 17584 states and 19865 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-01-08 23:43:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:13,350 INFO L93 Difference]: Finished difference Result 37006 states and 41840 transitions. [2025-01-08 23:43:13,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:13,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 299 [2025-01-08 23:43:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:13,382 INFO L225 Difference]: With dead ends: 37006 [2025-01-08 23:43:13,382 INFO L226 Difference]: Without dead ends: 19792 [2025-01-08 23:43:13,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:13,395 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 161 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:13,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 383 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19792 states. [2025-01-08 23:43:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19792 to 19056. [2025-01-08 23:43:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19056 states, 19055 states have (on average 1.1233272107058514) internal successors, (21405), 19055 states have internal predecessors, (21405), 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-01-08 23:43:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19056 states to 19056 states and 21405 transitions. [2025-01-08 23:43:13,536 INFO L78 Accepts]: Start accepts. Automaton has 19056 states and 21405 transitions. Word has length 299 [2025-01-08 23:43:13,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:13,537 INFO L471 AbstractCegarLoop]: Abstraction has 19056 states and 21405 transitions. [2025-01-08 23:43:13,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-01-08 23:43:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 19056 states and 21405 transitions. [2025-01-08 23:43:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-08 23:43:13,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:13,545 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:13,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:43:13,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:13,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1162199612, now seen corresponding path program 1 times [2025-01-08 23:43:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:13,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116851542] [2025-01-08 23:43:13,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:13,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-08 23:43:13,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-08 23:43:13,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:13,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:43:13,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:13,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116851542] [2025-01-08 23:43:13,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116851542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:13,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:13,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:43:13,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381370370] [2025-01-08 23:43:13,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:13,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:13,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:13,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:13,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:13,814 INFO L87 Difference]: Start difference. First operand 19056 states and 21405 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-01-08 23:43:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:14,943 INFO L93 Difference]: Finished difference Result 44206 states and 49740 transitions. [2025-01-08 23:43:14,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:14,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-01-08 23:43:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:14,964 INFO L225 Difference]: With dead ends: 44206 [2025-01-08 23:43:14,964 INFO L226 Difference]: Without dead ends: 27732 [2025-01-08 23:43:14,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:14,972 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 342 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:14,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 80 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:43:14,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27732 states. [2025-01-08 23:43:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27732 to 25695. [2025-01-08 23:43:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25695 states, 25694 states have (on average 1.1196777457772242) internal successors, (28769), 25694 states have internal predecessors, (28769), 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-01-08 23:43:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25695 states to 25695 states and 28769 transitions. [2025-01-08 23:43:15,178 INFO L78 Accepts]: Start accepts. Automaton has 25695 states and 28769 transitions. Word has length 319 [2025-01-08 23:43:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:15,179 INFO L471 AbstractCegarLoop]: Abstraction has 25695 states and 28769 transitions. [2025-01-08 23:43:15,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-01-08 23:43:15,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25695 states and 28769 transitions. [2025-01-08 23:43:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-08 23:43:15,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:15,188 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:15,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:43:15,188 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:15,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1409929348, now seen corresponding path program 1 times [2025-01-08 23:43:15,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:15,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70462991] [2025-01-08 23:43:15,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:15,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:15,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-08 23:43:15,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-08 23:43:15,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:15,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-01-08 23:43:15,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:15,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70462991] [2025-01-08 23:43:15,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70462991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:15,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:15,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080179694] [2025-01-08 23:43:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:15,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:15,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:15,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:15,287 INFO L87 Difference]: Start difference. First operand 25695 states and 28769 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-01-08 23:43:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:15,997 INFO L93 Difference]: Finished difference Result 52855 states and 59161 transitions. [2025-01-08 23:43:15,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:15,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 326 [2025-01-08 23:43:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:16,033 INFO L225 Difference]: With dead ends: 52855 [2025-01-08 23:43:16,033 INFO L226 Difference]: Without dead ends: 30846 [2025-01-08 23:43:16,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:16,074 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 188 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:16,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 148 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30846 states. [2025-01-08 23:43:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30846 to 19246. [2025-01-08 23:43:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19246 states, 19245 states have (on average 1.1286048324240063) internal successors, (21720), 19245 states have internal predecessors, (21720), 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-01-08 23:43:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19246 states to 19246 states and 21720 transitions. [2025-01-08 23:43:16,378 INFO L78 Accepts]: Start accepts. Automaton has 19246 states and 21720 transitions. Word has length 326 [2025-01-08 23:43:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:16,378 INFO L471 AbstractCegarLoop]: Abstraction has 19246 states and 21720 transitions. [2025-01-08 23:43:16,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-01-08 23:43:16,378 INFO L276 IsEmpty]: Start isEmpty. Operand 19246 states and 21720 transitions. [2025-01-08 23:43:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-01-08 23:43:16,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:16,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:16,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:43:16,385 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:16,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:16,385 INFO L85 PathProgramCache]: Analyzing trace with hash 582406179, now seen corresponding path program 1 times [2025-01-08 23:43:16,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:16,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451375630] [2025-01-08 23:43:16,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:16,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:16,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-01-08 23:43:16,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-01-08 23:43:16,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:16,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 59 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:16,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451375630] [2025-01-08 23:43:16,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451375630] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:43:16,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859428132] [2025-01-08 23:43:16,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:16,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:43:16,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:43:16,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:43:16,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:43:16,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-01-08 23:43:16,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-01-08 23:43:16,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:16,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:16,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 23:43:16,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:43:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 59 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:17,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:43:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 59 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:18,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859428132] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:43:18,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:43:18,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-01-08 23:43:18,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542101659] [2025-01-08 23:43:18,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:43:18,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 23:43:18,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:18,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 23:43:18,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:43:18,514 INFO L87 Difference]: Start difference. First operand 19246 states and 21720 transitions. Second operand has 10 states, 10 states have (on average 69.2) internal successors, (692), 9 states have internal predecessors, (692), 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-01-08 23:43:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:21,220 INFO L93 Difference]: Finished difference Result 65787 states and 73900 transitions. [2025-01-08 23:43:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 23:43:21,220 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 69.2) internal successors, (692), 9 states have internal predecessors, (692), 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 330 [2025-01-08 23:43:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:21,263 INFO L225 Difference]: With dead ends: 65787 [2025-01-08 23:43:21,264 INFO L226 Difference]: Without dead ends: 46174 [2025-01-08 23:43:21,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:43:21,281 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1206 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 3993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:21,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 194 Invalid, 3993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 3466 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:43:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46174 states. [2025-01-08 23:43:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46174 to 36222. [2025-01-08 23:43:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36222 states, 36221 states have (on average 1.1248170950553547) internal successors, (40742), 36221 states have internal predecessors, (40742), 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-01-08 23:43:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36222 states to 36222 states and 40742 transitions. [2025-01-08 23:43:21,646 INFO L78 Accepts]: Start accepts. Automaton has 36222 states and 40742 transitions. Word has length 330 [2025-01-08 23:43:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:21,647 INFO L471 AbstractCegarLoop]: Abstraction has 36222 states and 40742 transitions. [2025-01-08 23:43:21,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 69.2) internal successors, (692), 9 states have internal predecessors, (692), 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-01-08 23:43:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 36222 states and 40742 transitions. [2025-01-08 23:43:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-01-08 23:43:21,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:21,659 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:21,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:43:21,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-08 23:43:21,864 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:21,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:21,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1761921577, now seen corresponding path program 1 times [2025-01-08 23:43:21,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:21,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813303512] [2025-01-08 23:43:21,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:21,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-01-08 23:43:21,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-01-08 23:43:21,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:21,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-08 23:43:22,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:22,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813303512] [2025-01-08 23:43:22,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813303512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:22,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:22,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:22,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031719286] [2025-01-08 23:43:22,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:22,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:22,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:22,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:22,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:22,238 INFO L87 Difference]: Start difference. First operand 36222 states and 40742 transitions. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 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-01-08 23:43:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:23,013 INFO L93 Difference]: Finished difference Result 70416 states and 79134 transitions. [2025-01-08 23:43:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:23,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 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 402 [2025-01-08 23:43:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:23,050 INFO L225 Difference]: With dead ends: 70416 [2025-01-08 23:43:23,050 INFO L226 Difference]: Without dead ends: 36594 [2025-01-08 23:43:23,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:23,072 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 183 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:23,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 169 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36594 states. [2025-01-08 23:43:23,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36594 to 34014. [2025-01-08 23:43:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34014 states, 34013 states have (on average 1.12151236292006) internal successors, (38146), 34013 states have internal predecessors, (38146), 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-01-08 23:43:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34014 states to 34014 states and 38146 transitions. [2025-01-08 23:43:23,635 INFO L78 Accepts]: Start accepts. Automaton has 34014 states and 38146 transitions. Word has length 402 [2025-01-08 23:43:23,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:23,636 INFO L471 AbstractCegarLoop]: Abstraction has 34014 states and 38146 transitions. [2025-01-08 23:43:23,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 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-01-08 23:43:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 34014 states and 38146 transitions. [2025-01-08 23:43:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-01-08 23:43:23,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:23,662 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:23,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:43:23,662 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:23,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:23,662 INFO L85 PathProgramCache]: Analyzing trace with hash 222066228, now seen corresponding path program 1 times [2025-01-08 23:43:23,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:23,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390827475] [2025-01-08 23:43:23,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:23,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:23,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-08 23:43:23,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-08 23:43:23,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:23,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-01-08 23:43:23,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:23,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390827475] [2025-01-08 23:43:23,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390827475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:23,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:23,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558232326] [2025-01-08 23:43:23,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:23,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:23,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:23,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:23,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:23,806 INFO L87 Difference]: Start difference. First operand 34014 states and 38146 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-01-08 23:43:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:24,411 INFO L93 Difference]: Finished difference Result 66731 states and 74838 transitions. [2025-01-08 23:43:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:24,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 405 [2025-01-08 23:43:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:24,443 INFO L225 Difference]: With dead ends: 66731 [2025-01-08 23:43:24,444 INFO L226 Difference]: Without dead ends: 35116 [2025-01-08 23:43:24,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:24,466 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 167 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:24,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 365 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35116 states. [2025-01-08 23:43:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35116 to 19048. [2025-01-08 23:43:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19048 states, 19047 states have (on average 1.1172888118863864) internal successors, (21281), 19047 states have internal predecessors, (21281), 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-01-08 23:43:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19048 states to 19048 states and 21281 transitions. [2025-01-08 23:43:24,828 INFO L78 Accepts]: Start accepts. Automaton has 19048 states and 21281 transitions. Word has length 405 [2025-01-08 23:43:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:24,829 INFO L471 AbstractCegarLoop]: Abstraction has 19048 states and 21281 transitions. [2025-01-08 23:43:24,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-01-08 23:43:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 19048 states and 21281 transitions. [2025-01-08 23:43:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-01-08 23:43:24,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:24,840 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:24,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:43:24,840 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:24,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1703884414, now seen corresponding path program 1 times [2025-01-08 23:43:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:24,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157587017] [2025-01-08 23:43:24,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:24,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:24,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-01-08 23:43:24,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-01-08 23:43:24,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:24,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2025-01-08 23:43:25,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:25,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157587017] [2025-01-08 23:43:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157587017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:25,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:25,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840277832] [2025-01-08 23:43:25,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:25,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:25,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:25,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:25,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:25,041 INFO L87 Difference]: Start difference. First operand 19048 states and 21281 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-01-08 23:43:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:25,575 INFO L93 Difference]: Finished difference Result 39380 states and 43936 transitions. [2025-01-08 23:43:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:25,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 427 [2025-01-08 23:43:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:25,593 INFO L225 Difference]: With dead ends: 39380 [2025-01-08 23:43:25,593 INFO L226 Difference]: Without dead ends: 20150 [2025-01-08 23:43:25,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:25,605 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 172 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:25,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 148 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:43:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20150 states. [2025-01-08 23:43:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20150 to 18304. [2025-01-08 23:43:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18304 states, 18303 states have (on average 1.1118942249904387) internal successors, (20351), 18303 states have internal predecessors, (20351), 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-01-08 23:43:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18304 states to 18304 states and 20351 transitions. [2025-01-08 23:43:25,809 INFO L78 Accepts]: Start accepts. Automaton has 18304 states and 20351 transitions. Word has length 427 [2025-01-08 23:43:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:25,809 INFO L471 AbstractCegarLoop]: Abstraction has 18304 states and 20351 transitions. [2025-01-08 23:43:25,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-01-08 23:43:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 18304 states and 20351 transitions. [2025-01-08 23:43:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-01-08 23:43:25,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:25,822 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:25,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:43:25,823 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:25,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:25,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1834297183, now seen corresponding path program 1 times [2025-01-08 23:43:25,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:25,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708889345] [2025-01-08 23:43:25,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:25,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:25,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-01-08 23:43:25,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-01-08 23:43:25,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:25,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-08 23:43:26,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:26,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708889345] [2025-01-08 23:43:26,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708889345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:26,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:26,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 23:43:26,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953362649] [2025-01-08 23:43:26,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:26,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:43:26,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:26,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:43:26,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:43:26,533 INFO L87 Difference]: Start difference. First operand 18304 states and 20351 transitions. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 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-01-08 23:43:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:27,700 INFO L93 Difference]: Finished difference Result 45846 states and 50905 transitions. [2025-01-08 23:43:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:43:27,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 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 497 [2025-01-08 23:43:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:27,732 INFO L225 Difference]: With dead ends: 45846 [2025-01-08 23:43:27,732 INFO L226 Difference]: Without dead ends: 27544 [2025-01-08 23:43:27,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:43:27,747 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 390 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:27,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 88 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 23:43:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27544 states. [2025-01-08 23:43:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27544 to 21252. [2025-01-08 23:43:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21252 states, 21251 states have (on average 1.1088889934591313) internal successors, (23565), 21251 states have internal predecessors, (23565), 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-01-08 23:43:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21252 states to 21252 states and 23565 transitions. [2025-01-08 23:43:27,963 INFO L78 Accepts]: Start accepts. Automaton has 21252 states and 23565 transitions. Word has length 497 [2025-01-08 23:43:27,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:27,963 INFO L471 AbstractCegarLoop]: Abstraction has 21252 states and 23565 transitions. [2025-01-08 23:43:27,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 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-01-08 23:43:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 21252 states and 23565 transitions. [2025-01-08 23:43:27,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-01-08 23:43:27,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:27,972 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:27,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 23:43:27,972 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:27,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:27,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1259239171, now seen corresponding path program 1 times [2025-01-08 23:43:27,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:27,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924905781] [2025-01-08 23:43:27,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:27,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:28,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-08 23:43:28,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-08 23:43:28,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:28,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:43:28,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:28,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924905781] [2025-01-08 23:43:28,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924905781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:28,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:28,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 23:43:28,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624480936] [2025-01-08 23:43:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:28,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:43:28,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:28,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:43:28,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:43:28,422 INFO L87 Difference]: Start difference. First operand 21252 states and 23565 transitions. Second operand has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 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-01-08 23:43:29,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:29,408 INFO L93 Difference]: Finished difference Result 45468 states and 50290 transitions. [2025-01-08 23:43:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:43:29,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 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 501 [2025-01-08 23:43:29,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:29,454 INFO L225 Difference]: With dead ends: 45468 [2025-01-08 23:43:29,458 INFO L226 Difference]: Without dead ends: 24218 [2025-01-08 23:43:29,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:43:29,483 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 372 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:29,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 67 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:43:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24218 states. [2025-01-08 23:43:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24218 to 12396. [2025-01-08 23:43:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12396 states, 12395 states have (on average 1.1073013311819282) internal successors, (13725), 12395 states have internal predecessors, (13725), 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-01-08 23:43:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12396 states to 12396 states and 13725 transitions. [2025-01-08 23:43:29,635 INFO L78 Accepts]: Start accepts. Automaton has 12396 states and 13725 transitions. Word has length 501 [2025-01-08 23:43:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:29,636 INFO L471 AbstractCegarLoop]: Abstraction has 12396 states and 13725 transitions. [2025-01-08 23:43:29,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 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-01-08 23:43:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 12396 states and 13725 transitions. [2025-01-08 23:43:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-08 23:43:29,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:29,643 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:29,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 23:43:29,644 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:29,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1579258632, now seen corresponding path program 1 times [2025-01-08 23:43:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:29,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353860677] [2025-01-08 23:43:29,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:29,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-08 23:43:29,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-08 23:43:29,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:29,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-08 23:43:29,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:29,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353860677] [2025-01-08 23:43:29,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353860677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:29,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:29,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:29,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133651051] [2025-01-08 23:43:29,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:29,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:29,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:29,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:29,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:29,992 INFO L87 Difference]: Start difference. First operand 12396 states and 13725 transitions. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 3 states have internal predecessors, (489), 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-01-08 23:43:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:30,885 INFO L93 Difference]: Finished difference Result 29033 states and 32124 transitions. [2025-01-08 23:43:30,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:30,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 3 states have internal predecessors, (489), 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 518 [2025-01-08 23:43:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:30,899 INFO L225 Difference]: With dead ends: 29033 [2025-01-08 23:43:30,899 INFO L226 Difference]: Without dead ends: 16639 [2025-01-08 23:43:30,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:30,908 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 122 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:30,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 94 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:43:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16639 states. [2025-01-08 23:43:31,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16639 to 15347. [2025-01-08 23:43:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15347 states, 15346 states have (on average 1.1028280985273036) internal successors, (16924), 15346 states have internal predecessors, (16924), 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-01-08 23:43:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15347 states to 15347 states and 16924 transitions. [2025-01-08 23:43:31,081 INFO L78 Accepts]: Start accepts. Automaton has 15347 states and 16924 transitions. Word has length 518 [2025-01-08 23:43:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:31,082 INFO L471 AbstractCegarLoop]: Abstraction has 15347 states and 16924 transitions. [2025-01-08 23:43:31,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 3 states have internal predecessors, (489), 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-01-08 23:43:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 15347 states and 16924 transitions. [2025-01-08 23:43:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-01-08 23:43:31,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:31,091 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:31,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 23:43:31,091 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:31,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2098164554, now seen corresponding path program 1 times [2025-01-08 23:43:31,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:31,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959754279] [2025-01-08 23:43:31,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:31,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:31,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-01-08 23:43:31,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-01-08 23:43:31,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:31,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 30 proven. 396 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-01-08 23:43:31,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:31,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959754279] [2025-01-08 23:43:31,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959754279] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:43:31,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845749649] [2025-01-08 23:43:31,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:31,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:43:31,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:43:31,560 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:43:31,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:43:31,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-01-08 23:43:31,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-01-08 23:43:31,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:31,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:31,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 23:43:31,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:43:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 30 proven. 396 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-01-08 23:43:32,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:43:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 30 proven. 396 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-01-08 23:43:38,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845749649] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:43:38,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:43:38,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 11 [2025-01-08 23:43:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932677030] [2025-01-08 23:43:38,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:43:38,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 23:43:38,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:38,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 23:43:38,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-01-08 23:43:38,416 INFO L87 Difference]: Start difference. First operand 15347 states and 16924 transitions. Second operand has 12 states, 12 states have (on average 96.83333333333333) internal successors, (1162), 11 states have internal predecessors, (1162), 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-01-08 23:43:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:42,945 INFO L93 Difference]: Finished difference Result 56516 states and 62284 transitions. [2025-01-08 23:43:42,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-08 23:43:42,945 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 96.83333333333333) internal successors, (1162), 11 states have internal predecessors, (1162), 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 556 [2025-01-08 23:43:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:42,985 INFO L225 Difference]: With dead ends: 56516 [2025-01-08 23:43:42,985 INFO L226 Difference]: Without dead ends: 41171 [2025-01-08 23:43:43,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1121 GetRequests, 1104 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2025-01-08 23:43:43,003 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1850 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 4888 mSolverCounterSat, 1291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 6179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1291 IncrementalHoareTripleChecker+Valid, 4888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:43,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1850 Valid, 246 Invalid, 6179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1291 Valid, 4888 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-08 23:43:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41171 states. [2025-01-08 23:43:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41171 to 22721. [2025-01-08 23:43:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22721 states, 22720 states have (on average 1.1033890845070422) internal successors, (25069), 22720 states have internal predecessors, (25069), 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-01-08 23:43:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22721 states to 22721 states and 25069 transitions. [2025-01-08 23:43:43,278 INFO L78 Accepts]: Start accepts. Automaton has 22721 states and 25069 transitions. Word has length 556 [2025-01-08 23:43:43,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:43,279 INFO L471 AbstractCegarLoop]: Abstraction has 22721 states and 25069 transitions. [2025-01-08 23:43:43,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 96.83333333333333) internal successors, (1162), 11 states have internal predecessors, (1162), 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-01-08 23:43:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 22721 states and 25069 transitions. [2025-01-08 23:43:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2025-01-08 23:43:43,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:43,294 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:43,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:43:43,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:43:43,495 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:43,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2012296769, now seen corresponding path program 1 times [2025-01-08 23:43:43,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:43,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026844750] [2025-01-08 23:43:43,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:43,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:43,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 825 statements into 1 equivalence classes. [2025-01-08 23:43:43,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 825 of 825 statements. [2025-01-08 23:43:43,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:43,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1889 backedges. 1356 proven. 0 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2025-01-08 23:43:43,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:43,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026844750] [2025-01-08 23:43:43,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026844750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:43,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:43,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:43,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079878164] [2025-01-08 23:43:43,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:43,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:43,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:43,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:43,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:43,941 INFO L87 Difference]: Start difference. First operand 22721 states and 25069 transitions. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-01-08 23:43:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:44,624 INFO L93 Difference]: Finished difference Result 45462 states and 50171 transitions. [2025-01-08 23:43:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:44,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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 825 [2025-01-08 23:43:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:44,646 INFO L225 Difference]: With dead ends: 45462 [2025-01-08 23:43:44,646 INFO L226 Difference]: Without dead ends: 23111 [2025-01-08 23:43:44,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:44,658 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 101 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:44,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 144 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23111 states. [2025-01-08 23:43:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23111 to 22537. [2025-01-08 23:43:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22537 states, 22536 states have (on average 1.1012602058927938) internal successors, (24818), 22536 states have internal predecessors, (24818), 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-01-08 23:43:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22537 states to 22537 states and 24818 transitions. [2025-01-08 23:43:44,852 INFO L78 Accepts]: Start accepts. Automaton has 22537 states and 24818 transitions. Word has length 825 [2025-01-08 23:43:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:44,852 INFO L471 AbstractCegarLoop]: Abstraction has 22537 states and 24818 transitions. [2025-01-08 23:43:44,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-01-08 23:43:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 22537 states and 24818 transitions. [2025-01-08 23:43:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2025-01-08 23:43:44,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:44,867 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:44,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 23:43:44,868 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:44,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:44,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1445934226, now seen corresponding path program 1 times [2025-01-08 23:43:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:44,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468598071] [2025-01-08 23:43:44,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:44,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:44,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 858 statements into 1 equivalence classes. [2025-01-08 23:43:44,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 858 of 858 statements. [2025-01-08 23:43:44,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:44,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 1348 proven. 0 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2025-01-08 23:43:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468598071] [2025-01-08 23:43:45,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468598071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:45,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:45,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:45,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687808038] [2025-01-08 23:43:45,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:45,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:45,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:45,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:45,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:45,322 INFO L87 Difference]: Start difference. First operand 22537 states and 24818 transitions. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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-01-08 23:43:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:45,916 INFO L93 Difference]: Finished difference Result 41928 states and 46148 transitions. [2025-01-08 23:43:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:45,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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 858 [2025-01-08 23:43:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:45,918 INFO L225 Difference]: With dead ends: 41928 [2025-01-08 23:43:45,918 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:43:45,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:45,931 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 74 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:45,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 336 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:45,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:43:45,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:43:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:43:45,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 858 [2025-01-08 23:43:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:45,933 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:43:45,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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-01-08 23:43:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:43:45,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:43:45,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:43:45,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-08 23:43:45,938 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:45,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:44:09,677 WARN L286 SmtUtils]: Spent 23.73s on a formula simplification. DAG size of input: 1156 DAG size of output: 1447 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-08 23:44:17,468 WARN L286 SmtUtils]: Spent 7.78s on a formula simplification. DAG size of input: 1447 DAG size of output: 142 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-01-08 23:44:17,476 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:44:17,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:44:17 BoogieIcfgContainer [2025-01-08 23:44:17,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:44:17,521 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:44:17,521 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:44:17,521 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:44:17,522 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:58" (3/4) ... [2025-01-08 23:44:17,523 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:44:17,543 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:44:17,544 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:44:17,544 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:44:17,545 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:44:17,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:44:17,683 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:44:17,683 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:44:17,684 INFO L158 Benchmark]: Toolchain (without parser) took 80902.10ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 108.0MB in the beginning and 662.5MB in the end (delta: -554.5MB). Peak memory consumption was 626.4MB. Max. memory is 16.1GB. [2025-01-08 23:44:17,684 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:44:17,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.06ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 65.7MB in the end (delta: 42.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 23:44:17,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.58ms. Allocated memory is still 142.6MB. Free memory was 65.7MB in the beginning and 48.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:44:17,685 INFO L158 Benchmark]: Boogie Preprocessor took 176.92ms. Allocated memory is still 142.6MB. Free memory was 48.9MB in the beginning and 86.2MB in the end (delta: -37.3MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2025-01-08 23:44:17,685 INFO L158 Benchmark]: RCFGBuilder took 1258.62ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 86.2MB in the beginning and 238.0MB in the end (delta: -151.8MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2025-01-08 23:44:17,685 INFO L158 Benchmark]: TraceAbstraction took 78659.57ms. Allocated memory was 285.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 237.0MB in the beginning and 683.4MB in the end (delta: -446.4MB). Peak memory consumption was 895.0MB. Max. memory is 16.1GB. [2025-01-08 23:44:17,686 INFO L158 Benchmark]: Witness Printer took 162.16ms. Allocated memory is still 1.3GB. Free memory was 683.4MB in the beginning and 662.5MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:44:17,687 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.06ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 65.7MB in the end (delta: 42.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.58ms. Allocated memory is still 142.6MB. Free memory was 65.7MB in the beginning and 48.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 176.92ms. Allocated memory is still 142.6MB. Free memory was 48.9MB in the beginning and 86.2MB in the end (delta: -37.3MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1258.62ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 86.2MB in the beginning and 238.0MB in the end (delta: -151.8MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. * TraceAbstraction took 78659.57ms. Allocated memory was 285.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 237.0MB in the beginning and 683.4MB in the end (delta: -446.4MB). Peak memory consumption was 895.0MB. Max. memory is 16.1GB. * Witness Printer took 162.16ms. Allocated memory is still 1.3GB. Free memory was 683.4MB in the beginning and 662.5MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 112]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.0s, OverallIterations: 24, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 26.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7619 SdHoareTripleChecker+Valid, 23.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7619 mSDsluCounter, 5056 SdHoareTripleChecker+Invalid, 19.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 996 mSDsCounter, 4775 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25205 IncrementalHoareTripleChecker+Invalid, 29980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4775 mSolverCounterUnsat, 4060 mSDtfsCounter, 25205 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1853 GetRequests, 1795 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36222occurred in iteration=15, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 85006 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 9174 NumberOfCodeBlocks, 9174 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 10032 ConstructedInterpolants, 0 QuantifiedInterpolants, 53442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1139 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 10417/11977 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (0 <= ((long long) a23 + 599772))) && (a4 == 1)) && (a29 <= 130)) || ((((a29 <= 140) && (a23 <= 312)) && (0 <= ((long long) a23 + 379604))) && (a25 == 10))) || ((((((((307 <= a23) && (a25 == 11)) && (0 <= (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (a29 <= 599999)) && (a4 == 1)) && ((0 < (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (((((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0) || (0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1128373))) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (130 <= a29))) || ((((((((long long) 28300 + a29) <= 0) && (0 <= (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (0 <= ((long long) a23 + 907880))) && ((0 < (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (((((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0) || (0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1128373))) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a25 == 10))) || (((((((a29 <= 275) && (a25 == 11)) && (0 <= (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (a4 == 1)) && ((0 < (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (((((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0) || (0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1128373))) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (130 <= a29))) || (((((((307 <= a23) && (0 <= (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (a29 <= 599999)) && (a4 == 1)) && ((0 < (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (((((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0) || (0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1128373))) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a25 == 10))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 275)) && (a4 == 1))) || (((((((a25 == 13) && (a29 <= 384312)) && (307 <= a23)) && (0 <= (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (a4 == 1)) && ((0 < (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (((((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0) || (0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1128373))) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0)))) || ((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (a29 <= 220)) && (130 <= a29))) || ((((((long long) a23 + 43) <= 0) && (a29 <= 275)) && (a25 == 11)) && (0 <= ((long long) a23 + 379604)))) || ((((a25 == 13) && (((long long) a29 + 21) <= 0)) && (a23 <= 312)) && (0 <= ((long long) a23 + 379604)))) || (((((((0 <= (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) && (a29 <= 599999)) && (a25 == 9)) && (a4 == 1)) && ((0 < (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (((((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0) || (0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1128373))) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (277 <= a29))) || ((((a29 <= 140) && (a25 == 9)) && (a23 <= 312)) && (0 <= ((long long) a23 + 379604)))) || ((((((((long long) a23 + 43) <= 0) && (a29 <= 384312)) && (a25 == 9)) && (0 <= (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301593))) && ((((a23 >= 0) ? (a23 % 5) : ((a23 % 5) + 5)) != 0) || (0 < (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301593)))) && (277 <= a29))) || (((((a25 == 11) && (a29 <= 599999)) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 379604)))) || (((((((a25 == 11) && (0 <= (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (225979 <= a23)) && (a4 == 1)) && (((long long) a29 + 287232) <= 0)) && ((0 < (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (((((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0) || (0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1128373))) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0)))) || ((((a29 <= 571720) && (a25 <= 10)) && (381712 <= a29)) && (a4 == 1))) || ((((a29 <= 384312) && (a25 == 9)) && (a4 == 1)) && (a23 <= 312))) || ((((((((a25 == 12) && (a29 <= 384312)) && (307 <= a23)) && (0 <= (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (a4 == 1)) && ((0 < (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (((((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0) || (0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1128373))) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (130 <= a29))) || ((((((a29 <= 275) && (a25 == 12)) && (0 <= (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301593))) && (a23 <= 312)) && ((((a23 >= 0) ? (a23 % 5) : ((a23 % 5) + 5)) != 0) || (0 < (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301593)))) && (130 <= a29))) || (((((long long) a23 + 43) <= 0) && (a25 == 9)) && (((long long) a29 + 287232) <= 0))) || (((((long long) a23 + 43) <= 0) && (a25 <= 10)) && (a4 == 1))) || ((((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 275)) && (0 <= (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301593))) && ((((a23 >= 0) ? (a23 % 5) : ((a23 % 5) + 5)) != 0) || (0 < (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301593)))) && (130 <= a29))) || (((((((a29 <= 275) && (0 <= (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (a25 == 9)) && (a4 == 1)) && ((0 < (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (((((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0) || (0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1128373))) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (130 <= a29))) || (((((a29 <= 275) && (a25 == 12)) && (a4 == 1)) && (a23 <= 312)) && (130 <= a29))) || ((((((a25 <= 10) && (a29 <= 130)) || ((a25 == 12) && (a29 <= 130))) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 379604)))) || (((a29 <= 140) && (a25 == 11)) && (a23 <= 312))) || (((((((a29 <= 275) && (a25 == 12)) && (0 <= (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (0 <= ((long long) a23 + 379604))) && ((0 < (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (((((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0) || (0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1128373))) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (130 <= a29))) || (((((a25 == 13) && (a29 <= 384312)) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 379604)))) || (((((long long) a29 + 21) <= 0) && (a25 == 12)) && (a23 <= 312))) || (((((a25 == 12) && (0 <= (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (((long long) a29 + 287232) <= 0)) && ((0 < (1128373 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (((((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0) || (0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1128373))) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0)))) || ((307 <= a23) && (((((300138 <= a29) && (a25 == 11)) && (a29 <= 599999)) && (a4 == 1)) || ((((300138 <= a29) && (a25 <= 10)) && (a29 <= 599999)) && (a4 == 1))))) || ((((a25 == 11) && (a29 <= 599999)) && (a23 <= 312)) && (277 <= a29))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:44:17,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE