./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_label59.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 b318f94936d789f3e225c0b031e22ed136ba6b0572610da57c85f0ad4ebaa0a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:34:25,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:34:25,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:34:25,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:34:25,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:34:25,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:34:25,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:34:25,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:34:25,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:34:25,494 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:34:25,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:34:25,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:34:25,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:34:25,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:34:25,496 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:34:25,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:34:25,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:34:25,496 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:34:25,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:34:25,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:34:25,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:34:25,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:34:25,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:34:25,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:34:25,497 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:34:25,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:34:25,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:34:25,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:34:25,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:34:25,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:34:25,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:34:25,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:34:25,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:34:25,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:34:25,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:34:25,499 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:34:25,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:34:25,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:34:25,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:34:25,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:34:25,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:34:25,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:34:25,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:34:25,500 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 -> b318f94936d789f3e225c0b031e22ed136ba6b0572610da57c85f0ad4ebaa0a1 [2025-02-05 11:34:25,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:34:25,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:34:25,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:34:25,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:34:25,812 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:34:25,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label59.c [2025-02-05 11:34:27,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0200cef44/7628d590ef6c4b0c9aaf888c8226ced1/FLAG5e14bd8be [2025-02-05 11:34:27,625 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:34:27,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label59.c [2025-02-05 11:34:27,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0200cef44/7628d590ef6c4b0c9aaf888c8226ced1/FLAG5e14bd8be [2025-02-05 11:34:27,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0200cef44/7628d590ef6c4b0c9aaf888c8226ced1 [2025-02-05 11:34:27,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:34:27,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:34:27,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:34:27,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:34:27,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:34:27,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:34:27" (1/1) ... [2025-02-05 11:34:27,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3291da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:27, skipping insertion in model container [2025-02-05 11:34:27,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:34:27" (1/1) ... [2025-02-05 11:34:27,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:34:27,904 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_label59.c[8515,8528] [2025-02-05 11:34:28,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:34:28,099 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:34:28,130 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_label59.c[8515,8528] [2025-02-05 11:34:28,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:34:28,240 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:34:28,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28 WrapperNode [2025-02-05 11:34:28,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:34:28,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:34:28,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:34:28,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:34:28,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (1/1) ... [2025-02-05 11:34:28,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (1/1) ... [2025-02-05 11:34:28,367 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-02-05 11:34:28,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:34:28,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:34:28,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:34:28,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:34:28,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (1/1) ... [2025-02-05 11:34:28,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (1/1) ... [2025-02-05 11:34:28,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (1/1) ... [2025-02-05 11:34:28,455 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-02-05 11:34:28,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (1/1) ... [2025-02-05 11:34:28,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (1/1) ... [2025-02-05 11:34:28,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (1/1) ... [2025-02-05 11:34:28,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (1/1) ... [2025-02-05 11:34:28,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (1/1) ... [2025-02-05 11:34:28,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (1/1) ... [2025-02-05 11:34:28,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:34:28,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:34:28,566 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:34:28,566 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:34:28,567 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (1/1) ... [2025-02-05 11:34:28,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:34:28,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:28,600 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-02-05 11:34:28,605 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-02-05 11:34:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:34:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:34:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:34:28,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:34:28,724 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:34:28,726 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:34:30,416 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-05 11:34:30,417 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:34:30,439 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:34:30,440 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:34:30,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:30 BoogieIcfgContainer [2025-02-05 11:34:30,440 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:34:30,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:34:30,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:34:30,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:34:30,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:34:27" (1/3) ... [2025-02-05 11:34:30,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7790a80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:34:30, skipping insertion in model container [2025-02-05 11:34:30,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:28" (2/3) ... [2025-02-05 11:34:30,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7790a80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:34:30, skipping insertion in model container [2025-02-05 11:34:30,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:30" (3/3) ... [2025-02-05 11:34:30,449 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label59.c [2025-02-05 11:34:30,464 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:34:30,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label59.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:34:30,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:34:30,550 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;@33e26dbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:34:30,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:34:30,557 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-02-05 11:34:30,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 11:34:30,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:30,567 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, 1, 1, 1, 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-02-05 11:34:30,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:30,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1429132998, now seen corresponding path program 1 times [2025-02-05 11:34:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157458945] [2025-02-05 11:34:30,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:30,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 11:34:30,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 11:34:30,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:30,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:30,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:30,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157458945] [2025-02-05 11:34:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157458945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:30,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:30,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:34:30,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128742810] [2025-02-05 11:34:30,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:30,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:30,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:31,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:31,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:31,016 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 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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-02-05 11:34:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:32,180 INFO L93 Difference]: Finished difference Result 763 states and 1349 transitions. [2025-02-05 11:34:32,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:32,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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 59 [2025-02-05 11:34:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:32,192 INFO L225 Difference]: With dead ends: 763 [2025-02-05 11:34:32,192 INFO L226 Difference]: Without dead ends: 416 [2025-02-05 11:34:32,195 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-02-05 11:34:32,198 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 214 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:32,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 88 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:34:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-02-05 11:34:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2025-02-05 11:34:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 407 states have internal predecessors, (657), 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-02-05 11:34:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 657 transitions. [2025-02-05 11:34:32,285 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 657 transitions. Word has length 59 [2025-02-05 11:34:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:32,286 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 657 transitions. [2025-02-05 11:34:32,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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-02-05 11:34:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 657 transitions. [2025-02-05 11:34:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 11:34:32,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:32,292 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:32,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:34:32,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:32,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1625050384, now seen corresponding path program 1 times [2025-02-05 11:34:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:32,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041591658] [2025-02-05 11:34:32,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:32,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:32,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 11:34:32,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 11:34:32,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:32,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:32,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:32,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041591658] [2025-02-05 11:34:32,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041591658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:32,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:32,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:34:32,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999326140] [2025-02-05 11:34:32,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:32,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:32,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:32,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:32,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:32,559 INFO L87 Difference]: Start difference. First operand 408 states and 657 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-02-05 11:34:33,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:33,341 INFO L93 Difference]: Finished difference Result 1189 states and 1922 transitions. [2025-02-05 11:34:33,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:33,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2025-02-05 11:34:33,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:33,346 INFO L225 Difference]: With dead ends: 1189 [2025-02-05 11:34:33,347 INFO L226 Difference]: Without dead ends: 783 [2025-02-05 11:34:33,348 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-02-05 11:34:33,349 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 176 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:33,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 152 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-02-05 11:34:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2025-02-05 11:34:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4424552429667519) internal successors, (1128), 782 states have internal predecessors, (1128), 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-02-05 11:34:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1128 transitions. [2025-02-05 11:34:33,398 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1128 transitions. Word has length 124 [2025-02-05 11:34:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:33,398 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1128 transitions. [2025-02-05 11:34:33,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-02-05 11:34:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1128 transitions. [2025-02-05 11:34:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 11:34:33,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:33,406 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:33,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:34:33,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:33,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash -769157232, now seen corresponding path program 1 times [2025-02-05 11:34:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:33,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547534987] [2025-02-05 11:34:33,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:33,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 11:34:33,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 11:34:33,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:33,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:33,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:33,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547534987] [2025-02-05 11:34:33,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547534987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:33,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:34:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797349954] [2025-02-05 11:34:33,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:33,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:33,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:33,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:33,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:33,695 INFO L87 Difference]: Start difference. First operand 783 states and 1128 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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-02-05 11:34:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:34,389 INFO L93 Difference]: Finished difference Result 1942 states and 2803 transitions. [2025-02-05 11:34:34,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:34,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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 127 [2025-02-05 11:34:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:34,394 INFO L225 Difference]: With dead ends: 1942 [2025-02-05 11:34:34,394 INFO L226 Difference]: Without dead ends: 1161 [2025-02-05 11:34:34,395 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-02-05 11:34:34,396 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 143 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:34,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 175 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-02-05 11:34:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1151. [2025-02-05 11:34:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1150 states have (on average 1.337391304347826) internal successors, (1538), 1150 states have internal predecessors, (1538), 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-02-05 11:34:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1538 transitions. [2025-02-05 11:34:34,420 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1538 transitions. Word has length 127 [2025-02-05 11:34:34,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:34,421 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1538 transitions. [2025-02-05 11:34:34,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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-02-05 11:34:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1538 transitions. [2025-02-05 11:34:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 11:34:34,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:34,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:34,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:34:34,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:34,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:34,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2079612026, now seen corresponding path program 1 times [2025-02-05 11:34:34,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:34,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67150460] [2025-02-05 11:34:34,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:34,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:34,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 11:34:34,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 11:34:34,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:34,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67150460] [2025-02-05 11:34:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67150460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:34,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091530545] [2025-02-05 11:34:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:34,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:34,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:34,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:34,981 INFO L87 Difference]: Start difference. First operand 1151 states and 1538 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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-02-05 11:34:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:36,351 INFO L93 Difference]: Finished difference Result 3412 states and 4532 transitions. [2025-02-05 11:34:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:36,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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 128 [2025-02-05 11:34:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:36,363 INFO L225 Difference]: With dead ends: 3412 [2025-02-05 11:34:36,363 INFO L226 Difference]: Without dead ends: 2263 [2025-02-05 11:34:36,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:34:36,368 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:36,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 216 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:34:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2025-02-05 11:34:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1891. [2025-02-05 11:34:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1890 states have (on average 1.2476190476190476) internal successors, (2358), 1890 states have internal predecessors, (2358), 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-02-05 11:34:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2358 transitions. [2025-02-05 11:34:36,422 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2358 transitions. Word has length 128 [2025-02-05 11:34:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:36,423 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 2358 transitions. [2025-02-05 11:34:36,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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-02-05 11:34:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2358 transitions. [2025-02-05 11:34:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 11:34:36,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:36,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:36,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:34:36,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:36,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:36,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1715149109, now seen corresponding path program 1 times [2025-02-05 11:34:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:36,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096742218] [2025-02-05 11:34:36,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:36,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:36,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 11:34:36,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 11:34:36,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:36,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:36,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:36,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096742218] [2025-02-05 11:34:36,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096742218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:36,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:36,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:36,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278756640] [2025-02-05 11:34:36,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:36,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:36,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:36,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:36,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:36,924 INFO L87 Difference]: Start difference. First operand 1891 states and 2358 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:38,346 INFO L93 Difference]: Finished difference Result 6006 states and 7564 transitions. [2025-02-05 11:34:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:38,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2025-02-05 11:34:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:38,362 INFO L225 Difference]: With dead ends: 6006 [2025-02-05 11:34:38,362 INFO L226 Difference]: Without dead ends: 4117 [2025-02-05 11:34:38,366 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-02-05 11:34:38,366 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 245 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:38,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 81 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:34:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2025-02-05 11:34:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3739. [2025-02-05 11:34:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 3738 states have (on average 1.242108079186731) internal successors, (4643), 3738 states have internal predecessors, (4643), 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-02-05 11:34:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 4643 transitions. [2025-02-05 11:34:38,447 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 4643 transitions. Word has length 202 [2025-02-05 11:34:38,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:38,448 INFO L471 AbstractCegarLoop]: Abstraction has 3739 states and 4643 transitions. [2025-02-05 11:34:38,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 4643 transitions. [2025-02-05 11:34:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-02-05 11:34:38,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:38,452 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:34:38,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:34:38,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:38,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:38,453 INFO L85 PathProgramCache]: Analyzing trace with hash 961179666, now seen corresponding path program 1 times [2025-02-05 11:34:38,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:38,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562946599] [2025-02-05 11:34:38,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:38,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:38,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-02-05 11:34:38,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-02-05 11:34:38,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:38,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:38,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:38,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562946599] [2025-02-05 11:34:38,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562946599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:38,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:38,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:38,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143978657] [2025-02-05 11:34:38,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:38,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:38,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:38,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:38,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:38,736 INFO L87 Difference]: Start difference. First operand 3739 states and 4643 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-02-05 11:34:39,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:39,524 INFO L93 Difference]: Finished difference Result 8223 states and 10394 transitions. [2025-02-05 11:34:39,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:39,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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 239 [2025-02-05 11:34:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:39,542 INFO L225 Difference]: With dead ends: 8223 [2025-02-05 11:34:39,542 INFO L226 Difference]: Without dead ends: 4854 [2025-02-05 11:34:39,548 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-02-05 11:34:39,548 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:39,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 332 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4854 states. [2025-02-05 11:34:39,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4854 to 4660. [2025-02-05 11:34:39,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4660 states, 4659 states have (on average 1.2315947628246404) internal successors, (5738), 4659 states have internal predecessors, (5738), 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-02-05 11:34:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 5738 transitions. [2025-02-05 11:34:39,672 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 5738 transitions. Word has length 239 [2025-02-05 11:34:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:39,673 INFO L471 AbstractCegarLoop]: Abstraction has 4660 states and 5738 transitions. [2025-02-05 11:34:39,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-02-05 11:34:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 5738 transitions. [2025-02-05 11:34:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-02-05 11:34:39,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:39,678 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:34:39,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:34:39,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:39,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash -114518984, now seen corresponding path program 1 times [2025-02-05 11:34:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:39,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058727923] [2025-02-05 11:34:39,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:39,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-05 11:34:39,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-05 11:34:39,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:39,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 11:34:39,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:39,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058727923] [2025-02-05 11:34:39,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058727923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:39,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:39,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:39,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8301924] [2025-02-05 11:34:39,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:39,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:39,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:39,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:39,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:39,971 INFO L87 Difference]: Start difference. First operand 4660 states and 5738 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-02-05 11:34:40,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:40,759 INFO L93 Difference]: Finished difference Result 12652 states and 15758 transitions. [2025-02-05 11:34:40,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:40,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 240 [2025-02-05 11:34:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:40,786 INFO L225 Difference]: With dead ends: 12652 [2025-02-05 11:34:40,786 INFO L226 Difference]: Without dead ends: 8176 [2025-02-05 11:34:40,793 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-02-05 11:34:40,794 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 167 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:40,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 332 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8176 states. [2025-02-05 11:34:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 7256. [2025-02-05 11:34:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7256 states, 7255 states have (on average 1.2172294968986905) internal successors, (8831), 7255 states have internal predecessors, (8831), 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-02-05 11:34:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 8831 transitions. [2025-02-05 11:34:40,936 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 8831 transitions. Word has length 240 [2025-02-05 11:34:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:40,936 INFO L471 AbstractCegarLoop]: Abstraction has 7256 states and 8831 transitions. [2025-02-05 11:34:40,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-02-05 11:34:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 8831 transitions. [2025-02-05 11:34:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-05 11:34:40,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:40,941 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:34:40,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:34:40,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:40,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:40,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1449733579, now seen corresponding path program 1 times [2025-02-05 11:34:40,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:40,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763851465] [2025-02-05 11:34:40,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:40,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:40,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 11:34:41,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 11:34:41,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:41,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:41,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763851465] [2025-02-05 11:34:41,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763851465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:41,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:41,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:41,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511049063] [2025-02-05 11:34:41,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:41,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:41,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:41,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:41,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:41,322 INFO L87 Difference]: Start difference. First operand 7256 states and 8831 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 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-02-05 11:34:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:42,722 INFO L93 Difference]: Finished difference Result 15994 states and 19598 transitions. [2025-02-05 11:34:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:42,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 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 261 [2025-02-05 11:34:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:42,749 INFO L225 Difference]: With dead ends: 15994 [2025-02-05 11:34:42,749 INFO L226 Difference]: Without dead ends: 9107 [2025-02-05 11:34:42,758 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-02-05 11:34:42,758 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 230 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:42,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 143 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:34:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9107 states. [2025-02-05 11:34:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9107 to 8730. [2025-02-05 11:34:42,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8730 states, 8729 states have (on average 1.2023141253293619) internal successors, (10495), 8729 states have internal predecessors, (10495), 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-02-05 11:34:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8730 states to 8730 states and 10495 transitions. [2025-02-05 11:34:42,894 INFO L78 Accepts]: Start accepts. Automaton has 8730 states and 10495 transitions. Word has length 261 [2025-02-05 11:34:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:42,894 INFO L471 AbstractCegarLoop]: Abstraction has 8730 states and 10495 transitions. [2025-02-05 11:34:42,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 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-02-05 11:34:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8730 states and 10495 transitions. [2025-02-05 11:34:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-02-05 11:34:42,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:42,919 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:34:42,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:34:42,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:42,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:42,920 INFO L85 PathProgramCache]: Analyzing trace with hash -105665107, now seen corresponding path program 1 times [2025-02-05 11:34:42,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:42,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440688683] [2025-02-05 11:34:42,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:42,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:42,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-02-05 11:34:43,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-02-05 11:34:43,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:43,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 128 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:43,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:43,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440688683] [2025-02-05 11:34:43,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440688683] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:43,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119060982] [2025-02-05 11:34:43,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:43,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:43,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:43,604 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-02-05 11:34:43,605 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-02-05 11:34:43,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-02-05 11:34:43,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-02-05 11:34:43,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:43,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:43,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 11:34:43,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 128 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:44,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:34:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-05 11:34:44,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119060982] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:44,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 11:34:44,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 5 [2025-02-05 11:34:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702268521] [2025-02-05 11:34:44,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:44,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:44,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:44,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:44,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:34:44,214 INFO L87 Difference]: Start difference. First operand 8730 states and 10495 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-02-05 11:34:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:45,093 INFO L93 Difference]: Finished difference Result 16529 states and 19783 transitions. [2025-02-05 11:34:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:45,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 313 [2025-02-05 11:34:45,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:45,120 INFO L225 Difference]: With dead ends: 16529 [2025-02-05 11:34:45,120 INFO L226 Difference]: Without dead ends: 8169 [2025-02-05 11:34:45,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:34:45,130 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 160 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:45,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 306 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:34:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8169 states. [2025-02-05 11:34:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8169 to 7430. [2025-02-05 11:34:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7430 states, 7429 states have (on average 1.1790281329923273) internal successors, (8759), 7429 states have internal predecessors, (8759), 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-02-05 11:34:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7430 states to 7430 states and 8759 transitions. [2025-02-05 11:34:45,234 INFO L78 Accepts]: Start accepts. Automaton has 7430 states and 8759 transitions. Word has length 313 [2025-02-05 11:34:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:45,235 INFO L471 AbstractCegarLoop]: Abstraction has 7430 states and 8759 transitions. [2025-02-05 11:34:45,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-02-05 11:34:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 7430 states and 8759 transitions. [2025-02-05 11:34:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-05 11:34:45,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:45,246 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, 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, 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-02-05 11:34:45,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:34:45,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:45,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:45,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash 760656505, now seen corresponding path program 1 times [2025-02-05 11:34:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:45,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769741156] [2025-02-05 11:34:45,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:45,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:45,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-05 11:34:45,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-05 11:34:45,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:45,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-05 11:34:45,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:45,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769741156] [2025-02-05 11:34:45,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769741156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:45,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:45,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:45,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491816315] [2025-02-05 11:34:45,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:45,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:45,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:45,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:45,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:45,760 INFO L87 Difference]: Start difference. First operand 7430 states and 8759 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-02-05 11:34:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:46,574 INFO L93 Difference]: Finished difference Result 15783 states and 18676 transitions. [2025-02-05 11:34:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:46,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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 381 [2025-02-05 11:34:46,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:46,595 INFO L225 Difference]: With dead ends: 15783 [2025-02-05 11:34:46,595 INFO L226 Difference]: Without dead ends: 8539 [2025-02-05 11:34:46,603 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-02-05 11:34:46,603 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 107 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:46,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 356 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8539 states. [2025-02-05 11:34:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8539 to 8350. [2025-02-05 11:34:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8350 states, 8349 states have (on average 1.1727152952449396) internal successors, (9791), 8349 states have internal predecessors, (9791), 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-02-05 11:34:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8350 states to 8350 states and 9791 transitions. [2025-02-05 11:34:46,695 INFO L78 Accepts]: Start accepts. Automaton has 8350 states and 9791 transitions. Word has length 381 [2025-02-05 11:34:46,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:46,696 INFO L471 AbstractCegarLoop]: Abstraction has 8350 states and 9791 transitions. [2025-02-05 11:34:46,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-02-05 11:34:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 8350 states and 9791 transitions. [2025-02-05 11:34:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-02-05 11:34:46,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:46,708 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, 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, 2, 2, 2, 2, 2, 2, 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-02-05 11:34:46,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:34:46,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:46,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash 543865490, now seen corresponding path program 1 times [2025-02-05 11:34:46,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:46,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344816746] [2025-02-05 11:34:46,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:46,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:46,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-02-05 11:34:46,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-02-05 11:34:46,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:46,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-02-05 11:34:46,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:46,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344816746] [2025-02-05 11:34:46,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344816746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:46,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:46,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:46,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301058765] [2025-02-05 11:34:46,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:46,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:46,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:46,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:46,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:46,937 INFO L87 Difference]: Start difference. First operand 8350 states and 9791 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-02-05 11:34:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:47,598 INFO L93 Difference]: Finished difference Result 16325 states and 19195 transitions. [2025-02-05 11:34:47,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:47,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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 386 [2025-02-05 11:34:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:47,617 INFO L225 Difference]: With dead ends: 16325 [2025-02-05 11:34:47,618 INFO L226 Difference]: Without dead ends: 8347 [2025-02-05 11:34:47,626 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-02-05 11:34:47,627 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 173 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:47,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 301 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8347 states. [2025-02-05 11:34:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8347 to 8347. [2025-02-05 11:34:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8347 states, 8346 states have (on average 1.1483345315121016) internal successors, (9584), 8346 states have internal predecessors, (9584), 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-02-05 11:34:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8347 states to 8347 states and 9584 transitions. [2025-02-05 11:34:47,722 INFO L78 Accepts]: Start accepts. Automaton has 8347 states and 9584 transitions. Word has length 386 [2025-02-05 11:34:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:47,723 INFO L471 AbstractCegarLoop]: Abstraction has 8347 states and 9584 transitions. [2025-02-05 11:34:47,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-02-05 11:34:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 8347 states and 9584 transitions. [2025-02-05 11:34:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-05 11:34:47,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:47,736 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:47,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:34:47,736 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:47,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:47,737 INFO L85 PathProgramCache]: Analyzing trace with hash -207967553, now seen corresponding path program 1 times [2025-02-05 11:34:47,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:47,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878201317] [2025-02-05 11:34:47,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:47,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:47,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-05 11:34:47,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-05 11:34:47,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:47,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-02-05 11:34:48,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:48,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878201317] [2025-02-05 11:34:48,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878201317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:48,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:48,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:48,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282606919] [2025-02-05 11:34:48,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:48,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:48,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:48,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:48,041 INFO L87 Difference]: Start difference. First operand 8347 states and 9584 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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-02-05 11:34:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:48,665 INFO L93 Difference]: Finished difference Result 18542 states and 21347 transitions. [2025-02-05 11:34:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:48,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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 401 [2025-02-05 11:34:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:48,681 INFO L225 Difference]: With dead ends: 18542 [2025-02-05 11:34:48,681 INFO L226 Difference]: Without dead ends: 10567 [2025-02-05 11:34:48,691 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-02-05 11:34:48,691 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 141 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:48,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 116 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10567 states. [2025-02-05 11:34:48,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10567 to 10196. [2025-02-05 11:34:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10196 states, 10195 states have (on average 1.1368317802844532) internal successors, (11590), 10195 states have internal predecessors, (11590), 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-02-05 11:34:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10196 states to 10196 states and 11590 transitions. [2025-02-05 11:34:48,830 INFO L78 Accepts]: Start accepts. Automaton has 10196 states and 11590 transitions. Word has length 401 [2025-02-05 11:34:48,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:48,831 INFO L471 AbstractCegarLoop]: Abstraction has 10196 states and 11590 transitions. [2025-02-05 11:34:48,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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-02-05 11:34:48,831 INFO L276 IsEmpty]: Start isEmpty. Operand 10196 states and 11590 transitions. [2025-02-05 11:34:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-02-05 11:34:48,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:48,841 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:48,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:34:48,841 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:48,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash -868106440, now seen corresponding path program 1 times [2025-02-05 11:34:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:48,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035242319] [2025-02-05 11:34:48,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:48,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-02-05 11:34:48,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-02-05 11:34:48,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:48,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-02-05 11:34:49,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:49,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035242319] [2025-02-05 11:34:49,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035242319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:49,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:49,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:49,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637429125] [2025-02-05 11:34:49,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:49,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:49,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:49,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:49,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:49,420 INFO L87 Difference]: Start difference. First operand 10196 states and 11590 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-02-05 11:34:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:50,053 INFO L93 Difference]: Finished difference Result 21858 states and 24843 transitions. [2025-02-05 11:34:50,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:50,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 411 [2025-02-05 11:34:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:50,054 INFO L225 Difference]: With dead ends: 21858 [2025-02-05 11:34:50,054 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:34:50,064 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-02-05 11:34:50,064 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 161 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:50,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 310 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:34:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:34:50,065 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-02-05 11:34:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:34:50,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 411 [2025-02-05 11:34:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:50,066 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:34:50,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-02-05 11:34:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:34:50,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:34:50,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:34:50,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:34:50,072 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:50,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:34:51,059 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:34:51,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:34:51 BoogieIcfgContainer [2025-02-05 11:34:51,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:34:51,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:34:51,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:34:51,078 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:34:51,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:30" (3/4) ... [2025-02-05 11:34:51,080 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:34:51,105 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 11:34:51,107 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:34:51,108 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:34:51,109 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:34:51,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:34:51,274 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:34:51,274 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:34:51,275 INFO L158 Benchmark]: Toolchain (without parser) took 23606.32ms. Allocated memory was 167.8MB in the beginning and 637.5MB in the end (delta: 469.8MB). Free memory was 122.4MB in the beginning and 301.7MB in the end (delta: -179.3MB). Peak memory consumption was 287.6MB. Max. memory is 16.1GB. [2025-02-05 11:34:51,275 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:34:51,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.27ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 79.6MB in the end (delta: 42.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 11:34:51,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.62ms. Allocated memory is still 167.8MB. Free memory was 79.2MB in the beginning and 62.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 11:34:51,276 INFO L158 Benchmark]: Boogie Preprocessor took 195.39ms. Allocated memory is still 167.8MB. Free memory was 62.4MB in the beginning and 39.2MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:34:51,276 INFO L158 Benchmark]: IcfgBuilder took 1874.64ms. Allocated memory is still 167.8MB. Free memory was 39.2MB in the beginning and 99.9MB in the end (delta: -60.7MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2025-02-05 11:34:51,278 INFO L158 Benchmark]: TraceAbstraction took 20634.48ms. Allocated memory was 167.8MB in the beginning and 637.5MB in the end (delta: 469.8MB). Free memory was 98.7MB in the beginning and 318.5MB in the end (delta: -219.7MB). Peak memory consumption was 280.9MB. Max. memory is 16.1GB. [2025-02-05 11:34:51,278 INFO L158 Benchmark]: Witness Printer took 196.69ms. Allocated memory is still 637.5MB. Free memory was 318.5MB in the beginning and 301.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 11:34:51,279 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.32ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 572.27ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 79.6MB in the end (delta: 42.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.62ms. Allocated memory is still 167.8MB. Free memory was 79.2MB in the beginning and 62.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 195.39ms. Allocated memory is still 167.8MB. Free memory was 62.4MB in the beginning and 39.2MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1874.64ms. Allocated memory is still 167.8MB. Free memory was 39.2MB in the beginning and 99.9MB in the end (delta: -60.7MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20634.48ms. Allocated memory was 167.8MB in the beginning and 637.5MB in the end (delta: 469.8MB). Free memory was 98.7MB in the beginning and 318.5MB in the end (delta: -219.7MB). Peak memory consumption was 280.9MB. Max. memory is 16.1GB. * Witness Printer took 196.69ms. Allocated memory is still 637.5MB. Free memory was 318.5MB in the beginning and 301.7MB in the end (delta: 16.8MB). 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: 193]: 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: 19.6s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2538 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2538 mSDsluCounter, 2908 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 314 mSDsCounter, 1802 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8815 IncrementalHoareTripleChecker+Invalid, 10617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1802 mSolverCounterUnsat, 2594 mSDtfsCounter, 8815 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 662 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10196occurred in iteration=12, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 3558 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3585 NumberOfCodeBlocks, 3585 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3883 ConstructedInterpolants, 0 QuantifiedInterpolants, 7529 SizeOfPredicates, 1 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 3010/3124 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]: Location Invariant Derived location invariant: (((((((((10 <= a25) && (a23 <= 266)) || ((a25 == 12) && (141 <= a29))) || ((260 <= a29) && (a23 <= 137))) || ((a23 <= 266) && (a29 <= 220))) || ((141 <= a29) && (a4 == 1))) || ((a25 == 10) && (a29 <= 130))) || ((a25 == 12) && (a29 <= 130))) || ((10 <= a25) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:34:51,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE