./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label18.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/Problem02_label18.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 10ce6084b8eacd2d18483cb628f6c5abd6a714796c8d3c0285d28c3b447f089d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:44:05,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:44:05,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:44:05,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:44:05,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:44:05,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:44:05,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:44:05,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:44:05,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:44:05,644 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:44:05,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:44:05,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:44:05,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:44:05,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:44:05,645 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:44:05,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:44:05,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:44:05,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:44:05,647 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:44:05,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:44:05,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:44:05,648 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:44:05,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:44:05,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:44:05,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:44:05,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:44:05,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:44:05,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:44:05,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:44:05,648 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 -> 10ce6084b8eacd2d18483cb628f6c5abd6a714796c8d3c0285d28c3b447f089d [2025-02-05 10:44:05,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:44:05,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:44:05,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:44:05,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:44:05,936 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:44:05,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label18.c [2025-02-05 10:44:07,248 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8ededb59/343523cd365a4ae8923a67ae4c7d18ef/FLAG6e829a415 [2025-02-05 10:44:07,596 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:44:07,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label18.c [2025-02-05 10:44:07,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8ededb59/343523cd365a4ae8923a67ae4c7d18ef/FLAG6e829a415 [2025-02-05 10:44:07,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8ededb59/343523cd365a4ae8923a67ae4c7d18ef [2025-02-05 10:44:07,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:44:07,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:44:07,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:44:07,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:44:07,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:44:07,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:44:07" (1/1) ... [2025-02-05 10:44:07,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240f8d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:07, skipping insertion in model container [2025-02-05 10:44:07,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:44:07" (1/1) ... [2025-02-05 10:44:07,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:44:07,971 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/Problem02_label18.c[19853,19866] [2025-02-05 10:44:08,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:44:08,019 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:44:08,105 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/Problem02_label18.c[19853,19866] [2025-02-05 10:44:08,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:44:08,136 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:44:08,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08 WrapperNode [2025-02-05 10:44:08,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:44:08,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:44:08,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:44:08,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:44:08,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (1/1) ... [2025-02-05 10:44:08,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (1/1) ... [2025-02-05 10:44:08,215 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-02-05 10:44:08,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:44:08,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:44:08,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:44:08,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:44:08,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (1/1) ... [2025-02-05 10:44:08,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (1/1) ... [2025-02-05 10:44:08,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (1/1) ... [2025-02-05 10:44:08,258 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 10:44:08,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (1/1) ... [2025-02-05 10:44:08,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (1/1) ... [2025-02-05 10:44:08,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (1/1) ... [2025-02-05 10:44:08,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (1/1) ... [2025-02-05 10:44:08,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (1/1) ... [2025-02-05 10:44:08,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (1/1) ... [2025-02-05 10:44:08,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:44:08,313 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:44:08,313 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:44:08,313 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:44:08,314 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (1/1) ... [2025-02-05 10:44:08,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:44:08,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:44:08,347 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 10:44:08,353 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 10:44:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:44:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:44:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:44:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:44:08,448 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:44:08,450 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:44:09,463 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-02-05 10:44:09,464 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:44:09,485 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:44:09,486 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:44:09,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:44:09 BoogieIcfgContainer [2025-02-05 10:44:09,486 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:44:09,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:44:09,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:44:09,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:44:09,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:44:07" (1/3) ... [2025-02-05 10:44:09,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7677cf96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:44:09, skipping insertion in model container [2025-02-05 10:44:09,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:08" (2/3) ... [2025-02-05 10:44:09,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7677cf96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:44:09, skipping insertion in model container [2025-02-05 10:44:09,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:44:09" (3/3) ... [2025-02-05 10:44:09,496 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label18.c [2025-02-05 10:44:09,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:44:09,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label18.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:44:09,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:44:09,598 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;@665e7f3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:44:09,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:44:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 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 10:44:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 10:44:09,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:09,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:44:09,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2135163467, now seen corresponding path program 1 times [2025-02-05 10:44:09,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:09,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782139517] [2025-02-05 10:44:09,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:09,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:09,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 10:44:09,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 10:44:09,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:09,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:10,283 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 10:44:10,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:10,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782139517] [2025-02-05 10:44:10,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782139517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:10,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:10,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012460459] [2025-02-05 10:44:10,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:10,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:10,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:10,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:10,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:10,314 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 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 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 10:44:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:11,041 INFO L93 Difference]: Finished difference Result 630 states and 1067 transitions. [2025-02-05 10:44:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:11,043 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 10:44:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:11,056 INFO L225 Difference]: With dead ends: 630 [2025-02-05 10:44:11,056 INFO L226 Difference]: Without dead ends: 318 [2025-02-05 10:44:11,060 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 10:44:11,063 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 103 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:11,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:44:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-05 10:44:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-02-05 10:44:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 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 10:44:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2025-02-05 10:44:11,114 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 127 [2025-02-05 10:44:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:11,115 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2025-02-05 10:44:11,115 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 10:44:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2025-02-05 10:44:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 10:44:11,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:11,119 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:11,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:44:11,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:11,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:11,120 INFO L85 PathProgramCache]: Analyzing trace with hash 846430728, now seen corresponding path program 1 times [2025-02-05 10:44:11,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:11,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359927275] [2025-02-05 10:44:11,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:11,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:11,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 10:44:11,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 10:44:11,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:11,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:11,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:11,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359927275] [2025-02-05 10:44:11,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359927275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:11,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:11,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:11,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097802527] [2025-02-05 10:44:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:11,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:44:11,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:11,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:44:11,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:44:11,589 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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 10:44:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:12,331 INFO L93 Difference]: Finished difference Result 999 states and 1508 transitions. [2025-02-05 10:44:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:44:12,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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 131 [2025-02-05 10:44:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:12,335 INFO L225 Difference]: With dead ends: 999 [2025-02-05 10:44:12,335 INFO L226 Difference]: Without dead ends: 600 [2025-02-05 10:44:12,339 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 10:44:12,340 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 170 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:12,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 114 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:44:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-02-05 10:44:12,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-02-05 10:44:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.357262103505843) internal successors, (813), 599 states have internal predecessors, (813), 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 10:44:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 813 transitions. [2025-02-05 10:44:12,379 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 813 transitions. Word has length 131 [2025-02-05 10:44:12,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:12,379 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 813 transitions. [2025-02-05 10:44:12,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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 10:44:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 813 transitions. [2025-02-05 10:44:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 10:44:12,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:12,388 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:44:12,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:44:12,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:12,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1349410128, now seen corresponding path program 1 times [2025-02-05 10:44:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:12,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45220454] [2025-02-05 10:44:12,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:12,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 10:44:12,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 10:44:12,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:12,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:12,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:12,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45220454] [2025-02-05 10:44:12,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45220454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:12,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:12,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:12,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905052282] [2025-02-05 10:44:12,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:12,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:12,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:12,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:12,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:12,643 INFO L87 Difference]: Start difference. First operand 600 states and 813 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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 10:44:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:13,109 INFO L93 Difference]: Finished difference Result 1781 states and 2418 transitions. [2025-02-05 10:44:13,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:13,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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 145 [2025-02-05 10:44:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:13,116 INFO L225 Difference]: With dead ends: 1781 [2025-02-05 10:44:13,116 INFO L226 Difference]: Without dead ends: 1183 [2025-02-05 10:44:13,118 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 10:44:13,118 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:13,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 99 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-02-05 10:44:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1173. [2025-02-05 10:44:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.3114334470989761) internal successors, (1537), 1172 states have internal predecessors, (1537), 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 10:44:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1537 transitions. [2025-02-05 10:44:13,152 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1537 transitions. Word has length 145 [2025-02-05 10:44:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:13,152 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1537 transitions. [2025-02-05 10:44:13,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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 10:44:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1537 transitions. [2025-02-05 10:44:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 10:44:13,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:13,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:44:13,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:44:13,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:13,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash -436048993, now seen corresponding path program 1 times [2025-02-05 10:44:13,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:13,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176612691] [2025-02-05 10:44:13,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:13,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:13,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 10:44:13,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 10:44:13,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:13,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:13,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176612691] [2025-02-05 10:44:13,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176612691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:13,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:13,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:13,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504435808] [2025-02-05 10:44:13,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:13,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:13,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:13,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:13,329 INFO L87 Difference]: Start difference. First operand 1173 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 10:44:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:13,850 INFO L93 Difference]: Finished difference Result 3329 states and 4387 transitions. [2025-02-05 10:44:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:13,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 151 [2025-02-05 10:44:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:13,858 INFO L225 Difference]: With dead ends: 3329 [2025-02-05 10:44:13,859 INFO L226 Difference]: Without dead ends: 2158 [2025-02-05 10:44:13,860 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 10:44:13,862 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 124 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:13,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 129 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:44:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2025-02-05 10:44:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2155. [2025-02-05 10:44:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.1996285979572887) internal successors, (2584), 2154 states have internal predecessors, (2584), 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 10:44:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2584 transitions. [2025-02-05 10:44:13,919 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2584 transitions. Word has length 151 [2025-02-05 10:44:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:13,919 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 2584 transitions. [2025-02-05 10:44:13,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 10:44:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2584 transitions. [2025-02-05 10:44:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 10:44:13,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:13,924 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:44:13,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:44:13,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:13,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1534601635, now seen corresponding path program 1 times [2025-02-05 10:44:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:13,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286490878] [2025-02-05 10:44:13,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:13,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 10:44:13,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 10:44:13,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:13,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:14,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286490878] [2025-02-05 10:44:14,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286490878] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:44:14,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092488658] [2025-02-05 10:44:14,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:14,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:14,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:44:14,315 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 10:44:14,318 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 10:44:14,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 10:44:14,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 10:44:14,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:14,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:14,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:44:14,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:44:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:44:14,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:44:14,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092488658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:14,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:44:14,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:44:14,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460411074] [2025-02-05 10:44:14,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:14,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:14,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:14,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:44:14,606 INFO L87 Difference]: Start difference. First operand 2155 states and 2584 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:15,112 INFO L93 Difference]: Finished difference Result 5434 states and 6646 transitions. [2025-02-05 10:44:15,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:15,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2025-02-05 10:44:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:15,124 INFO L225 Difference]: With dead ends: 5434 [2025-02-05 10:44:15,125 INFO L226 Difference]: Without dead ends: 3281 [2025-02-05 10:44:15,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:44:15,128 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 52 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:15,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 67 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:44:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2025-02-05 10:44:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3275. [2025-02-05 10:44:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3274 states have (on average 1.2193036041539402) internal successors, (3992), 3274 states have internal predecessors, (3992), 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 10:44:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 3992 transitions. [2025-02-05 10:44:15,197 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 3992 transitions. Word has length 154 [2025-02-05 10:44:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:15,197 INFO L471 AbstractCegarLoop]: Abstraction has 3275 states and 3992 transitions. [2025-02-05 10:44:15,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 3992 transitions. [2025-02-05 10:44:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 10:44:15,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:15,205 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:44:15,214 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 10:44:15,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:15,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:15,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash 908768877, now seen corresponding path program 1 times [2025-02-05 10:44:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:15,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624519070] [2025-02-05 10:44:15,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:15,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:15,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 10:44:15,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 10:44:15,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:15,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:44:15,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:15,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624519070] [2025-02-05 10:44:15,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624519070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:15,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:15,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:15,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165945376] [2025-02-05 10:44:15,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:15,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:15,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:15,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:15,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:15,586 INFO L87 Difference]: Start difference. First operand 3275 states and 3992 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 10:44:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:16,045 INFO L93 Difference]: Finished difference Result 7532 states and 9216 transitions. [2025-02-05 10:44:16,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:16,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 227 [2025-02-05 10:44:16,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:16,059 INFO L225 Difference]: With dead ends: 7532 [2025-02-05 10:44:16,059 INFO L226 Difference]: Without dead ends: 3699 [2025-02-05 10:44:16,065 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 10:44:16,066 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 93 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:16,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 244 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3699 states. [2025-02-05 10:44:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3699 to 3699. [2025-02-05 10:44:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3699 states, 3698 states have (on average 1.0995132504056246) internal successors, (4066), 3698 states have internal predecessors, (4066), 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 10:44:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3699 states to 3699 states and 4066 transitions. [2025-02-05 10:44:16,137 INFO L78 Accepts]: Start accepts. Automaton has 3699 states and 4066 transitions. Word has length 227 [2025-02-05 10:44:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:16,138 INFO L471 AbstractCegarLoop]: Abstraction has 3699 states and 4066 transitions. [2025-02-05 10:44:16,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 10:44:16,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3699 states and 4066 transitions. [2025-02-05 10:44:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-05 10:44:16,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:16,146 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:44:16,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:44:16,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:16,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:16,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1081155980, now seen corresponding path program 1 times [2025-02-05 10:44:16,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:16,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850045071] [2025-02-05 10:44:16,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:16,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:16,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-05 10:44:16,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-05 10:44:16,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:16,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-02-05 10:44:16,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:16,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850045071] [2025-02-05 10:44:16,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850045071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:16,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:16,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:44:16,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468318279] [2025-02-05 10:44:16,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:16,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:44:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:16,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:44:16,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:44:16,483 INFO L87 Difference]: Start difference. First operand 3699 states and 4066 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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 10:44:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:17,243 INFO L93 Difference]: Finished difference Result 7676 states and 8424 transitions. [2025-02-05 10:44:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:44:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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 250 [2025-02-05 10:44:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:17,257 INFO L225 Difference]: With dead ends: 7676 [2025-02-05 10:44:17,257 INFO L226 Difference]: Without dead ends: 3979 [2025-02-05 10:44:17,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:44:17,263 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 328 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:17,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 142 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:44:17,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2025-02-05 10:44:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3839. [2025-02-05 10:44:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3839 states, 3838 states have (on average 1.09666492965086) internal successors, (4209), 3838 states have internal predecessors, (4209), 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 10:44:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 4209 transitions. [2025-02-05 10:44:17,358 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 4209 transitions. Word has length 250 [2025-02-05 10:44:17,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:17,359 INFO L471 AbstractCegarLoop]: Abstraction has 3839 states and 4209 transitions. [2025-02-05 10:44:17,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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 10:44:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 4209 transitions. [2025-02-05 10:44:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-02-05 10:44:17,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:17,367 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 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] [2025-02-05 10:44:17,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:44:17,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:17,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:17,368 INFO L85 PathProgramCache]: Analyzing trace with hash 220643463, now seen corresponding path program 1 times [2025-02-05 10:44:17,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:17,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910949229] [2025-02-05 10:44:17,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:17,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:17,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-02-05 10:44:17,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-02-05 10:44:17,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:17,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-05 10:44:17,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:17,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910949229] [2025-02-05 10:44:17,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910949229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:17,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:17,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:17,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704584651] [2025-02-05 10:44:17,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:17,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:17,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:17,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:17,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:17,554 INFO L87 Difference]: Start difference. First operand 3839 states and 4209 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 10:44:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:17,961 INFO L93 Difference]: Finished difference Result 8088 states and 8980 transitions. [2025-02-05 10:44:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:17,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 289 [2025-02-05 10:44:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:17,972 INFO L225 Difference]: With dead ends: 8088 [2025-02-05 10:44:17,972 INFO L226 Difference]: Without dead ends: 3123 [2025-02-05 10:44:17,977 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 10:44:17,978 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 101 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:17,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 254 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:17,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2025-02-05 10:44:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 2982. [2025-02-05 10:44:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2982 states, 2981 states have (on average 1.0831935592083193) internal successors, (3229), 2981 states have internal predecessors, (3229), 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 10:44:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 3229 transitions. [2025-02-05 10:44:18,033 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 3229 transitions. Word has length 289 [2025-02-05 10:44:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:18,034 INFO L471 AbstractCegarLoop]: Abstraction has 2982 states and 3229 transitions. [2025-02-05 10:44:18,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 10:44:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 3229 transitions. [2025-02-05 10:44:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-05 10:44:18,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:18,041 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:18,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:44:18,042 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:18,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash 129774965, now seen corresponding path program 1 times [2025-02-05 10:44:18,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:18,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209563743] [2025-02-05 10:44:18,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:18,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:18,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-05 10:44:18,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-05 10:44:18,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:18,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-02-05 10:44:18,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:18,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209563743] [2025-02-05 10:44:18,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209563743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:18,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:18,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:18,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263968263] [2025-02-05 10:44:18,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:18,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:18,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:18,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:18,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:18,272 INFO L87 Difference]: Start difference. First operand 2982 states and 3229 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 10:44:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:18,697 INFO L93 Difference]: Finished difference Result 6804 states and 7445 transitions. [2025-02-05 10:44:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:18,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 305 [2025-02-05 10:44:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:18,712 INFO L225 Difference]: With dead ends: 6804 [2025-02-05 10:44:18,712 INFO L226 Difference]: Without dead ends: 3824 [2025-02-05 10:44:18,717 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 10:44:18,719 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 133 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:18,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 204 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3824 states. [2025-02-05 10:44:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3824 to 3402. [2025-02-05 10:44:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3402 states, 3401 states have (on average 1.089679506027639) internal successors, (3706), 3401 states have internal predecessors, (3706), 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 10:44:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 3706 transitions. [2025-02-05 10:44:18,803 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 3706 transitions. Word has length 305 [2025-02-05 10:44:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:18,803 INFO L471 AbstractCegarLoop]: Abstraction has 3402 states and 3706 transitions. [2025-02-05 10:44:18,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 10:44:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 3706 transitions. [2025-02-05 10:44:18,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-05 10:44:18,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:18,812 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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, 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] [2025-02-05 10:44:18,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:44:18,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:18,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash 992574808, now seen corresponding path program 1 times [2025-02-05 10:44:18,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:18,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334221388] [2025-02-05 10:44:18,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:18,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-05 10:44:18,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-05 10:44:18,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:18,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-02-05 10:44:18,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:18,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334221388] [2025-02-05 10:44:18,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334221388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:18,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:18,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:18,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041944402] [2025-02-05 10:44:18,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:18,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:18,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:18,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:18,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:18,961 INFO L87 Difference]: Start difference. First operand 3402 states and 3706 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 10:44:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:19,348 INFO L93 Difference]: Finished difference Result 7221 states and 7855 transitions. [2025-02-05 10:44:19,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:19,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 328 [2025-02-05 10:44:19,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:19,349 INFO L225 Difference]: With dead ends: 7221 [2025-02-05 10:44:19,349 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:44:19,356 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 10:44:19,356 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 158 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:19,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 69 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:19,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:44:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:44:19,357 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 10:44:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:44:19,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 328 [2025-02-05 10:44:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:19,358 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:44:19,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 10:44:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:44:19,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:44:19,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:44:19,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:44:19,364 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:19,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:44:19,627 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:44:19,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:44:19 BoogieIcfgContainer [2025-02-05 10:44:19,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:44:19,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:44:19,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:44:19,651 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:44:19,651 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:44:09" (3/4) ... [2025-02-05 10:44:19,653 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:44:19,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 10:44:19,677 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:44:19,678 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:44:19,679 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:44:19,798 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:44:19,799 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:44:19,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:44:19,801 INFO L158 Benchmark]: Toolchain (without parser) took 12172.22ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 121.6MB in the beginning and 387.3MB in the end (delta: -265.7MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2025-02-05 10:44:19,801 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:44:19,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.81ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 95.4MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 10:44:19,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.82ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 90.4MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:44:19,802 INFO L158 Benchmark]: Boogie Preprocessor took 90.53ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 86.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:44:19,802 INFO L158 Benchmark]: IcfgBuilder took 1173.62ms. Allocated memory is still 167.8MB. Free memory was 86.3MB in the beginning and 91.1MB in the end (delta: -4.8MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. [2025-02-05 10:44:19,802 INFO L158 Benchmark]: TraceAbstraction took 10161.35ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 90.3MB in the beginning and 399.9MB in the end (delta: -309.6MB). Peak memory consumption was 219.1MB. Max. memory is 16.1GB. [2025-02-05 10:44:19,803 INFO L158 Benchmark]: Witness Printer took 148.81ms. Allocated memory is still 444.6MB. Free memory was 399.9MB in the beginning and 387.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 10:44:19,804 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.18ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.81ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 95.4MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.82ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 90.4MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.53ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 86.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1173.62ms. Allocated memory is still 167.8MB. Free memory was 86.3MB in the beginning and 91.1MB in the end (delta: -4.8MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10161.35ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 90.3MB in the beginning and 399.9MB in the end (delta: -309.6MB). Peak memory consumption was 219.1MB. Max. memory is 16.1GB. * Witness Printer took 148.81ms. Allocated memory is still 444.6MB. Free memory was 399.9MB in the beginning and 387.3MB in the end (delta: 12.6MB). 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: 563]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1420 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1420 mSDsluCounter, 1441 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 729 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4492 IncrementalHoareTripleChecker+Invalid, 5221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 729 mSolverCounterUnsat, 1204 mSDtfsCounter, 4492 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3839occurred in iteration=7, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 722 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2261 NumberOfCodeBlocks, 2261 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2250 ConstructedInterpolants, 0 QuantifiedInterpolants, 6913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1603/1619 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: 616]: Location Invariant Derived location invariant: ((((((((((a11 <= 0) && (a25 == 0)) || ((a17 <= 7) && (a28 <= 10))) || ((9 <= a28) && (a28 <= 10))) || ((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (a28 < 8)) || ((a28 <= 10) && (a19 == 1))) || ((a17 <= 7) && (a19 == 1))) || ((a28 <= 10) && (a25 == 0))) || ((a17 <= 7) && (a11 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:44:19,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE